./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:26:51,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:26:52,064 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 11:26:52,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:26:52,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:26:52,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:26:52,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:26:52,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:26:52,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:26:52,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:26:52,105 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:26:52,107 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:26:52,108 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:26:52,108 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:26:52,108 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:26:52,109 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:26:52,109 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:26:52,109 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:26:52,110 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:26:52,113 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:26:52,113 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:26:52,114 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:26:52,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 11:26:52,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 11:26:52,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:26:52,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:26:52,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:26:52,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:26:52,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:26:52,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 11:26:52,120 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 11:26:52,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 11:26:52,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:26:52,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 11:26:52,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:26:52,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:26:52,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:26:52,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:26:52,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:26:52,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:26:52,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:26:52,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:26:52,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:26:52,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:26:52,125 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:26:52,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:26:52,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:26:52,126 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:26:52,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:26:52,126 INFO L153 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_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/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_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2024-11-02 11:26:52,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:26:52,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:26:52,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:26:52,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:26:52,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:26:52,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/memsafety/test-0019-1.i Unable to find full path for "g++" [2024-11-02 11:26:54,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:26:54,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:26:54,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/sv-benchmarks/c/memsafety/test-0019-1.i [2024-11-02 11:26:54,742 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/data/8e69848ec/d9acf8bfd9ae4151a6e2c3cfdfe02cf0/FLAG69c468756 [2024-11-02 11:26:54,759 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/data/8e69848ec/d9acf8bfd9ae4151a6e2c3cfdfe02cf0 [2024-11-02 11:26:54,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:26:54,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:26:54,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:26:54,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:26:54,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:26:54,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:26:54" (1/1) ... [2024-11-02 11:26:54,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7c9734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:54, skipping insertion in model container [2024-11-02 11:26:54,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:26:54" (1/1) ... [2024-11-02 11:26:54,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:26:55,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:26:55,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:26:55,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:26:55,325 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:26:55,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55 WrapperNode [2024-11-02 11:26:55,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:26:55,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:26:55,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:26:55,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:26:55,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,369 INFO L138 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2024-11-02 11:26:55,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:26:55,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:26:55,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:26:55,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:26:55,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:26:55,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:26:55,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:26:55,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:26:55,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (1/1) ... [2024-11-02 11:26:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:26:55,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:55,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:26:55,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:26:55,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 11:26:55,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:26:55,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 11:26:55,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 11:26:55,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 11:26:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 11:26:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:26:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:26:55,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:26:55,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:26:55,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:26:55,895 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-02 11:26:55,895 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:26:55,971 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:26:55,972 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 11:26:55,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:55 BoogieIcfgContainer [2024-11-02 11:26:55,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:26:55,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:26:55,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:26:55,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:26:55,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:26:54" (1/3) ... [2024-11-02 11:26:55,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be28100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:26:55, skipping insertion in model container [2024-11-02 11:26:55,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:55" (2/3) ... [2024-11-02 11:26:55,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be28100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:26:55, skipping insertion in model container [2024-11-02 11:26:55,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:55" (3/3) ... [2024-11-02 11:26:55,987 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2024-11-02 11:26:56,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:26:56,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-02 11:26:56,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:26:56,100 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b0a1318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:26:56,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-02 11:26:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 41 states have internal predecessors, (42), 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) [2024-11-02 11:26:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-02 11:26:56,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:56,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-02 11:26:56,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:56,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2794, now seen corresponding path program 1 times [2024-11-02 11:26:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698690159] [2024-11-02 11:26:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:56,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698690159] [2024-11-02 11:26:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698690159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:56,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 11:26:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579069283] [2024-11-02 11:26:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:56,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:56,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:56,691 INFO L87 Difference]: Start difference. First operand has 42 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 41 states have internal predecessors, (42), 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) [2024-11-02 11:26:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:56,801 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-02 11:26:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:56,804 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 [2024-11-02 11:26:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:56,812 INFO L225 Difference]: With dead ends: 40 [2024-11-02 11:26:56,813 INFO L226 Difference]: Without dead ends: 39 [2024-11-02 11:26:56,815 INFO L431 NwaCegarLoop]: 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 [2024-11-02 11:26:56,819 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:56,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-02 11:26:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-02 11:26:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 38 states have internal predecessors, (39), 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) [2024-11-02 11:26:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-02 11:26:56,859 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 2 [2024-11-02 11:26:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:56,860 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-02 11:26:56,860 INFO L472 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) [2024-11-02 11:26:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-02 11:26:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-02 11:26:56,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:56,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-02 11:26:56,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:26:56,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2795, now seen corresponding path program 1 times [2024-11-02 11:26:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590877126] [2024-11-02 11:26:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:57,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:57,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590877126] [2024-11-02 11:26:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590877126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 11:26:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838294030] [2024-11-02 11:26:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:57,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:57,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:57,098 INFO L87 Difference]: Start difference. First operand 39 states and 39 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) [2024-11-02 11:26:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:57,158 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-11-02 11:26:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:57,160 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 [2024-11-02 11:26:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:57,161 INFO L225 Difference]: With dead ends: 37 [2024-11-02 11:26:57,161 INFO L226 Difference]: Without dead ends: 37 [2024-11-02 11:26:57,162 INFO L431 NwaCegarLoop]: 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 [2024-11-02 11:26:57,163 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:57,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-02 11:26:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-02 11:26:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 36 states have internal predecessors, (37), 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) [2024-11-02 11:26:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-02 11:26:57,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 2 [2024-11-02 11:26:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-11-02 11:26:57,176 INFO L472 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) [2024-11-02 11:26:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-02 11:26:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 11:26:57,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:57,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 11:26:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:26:57,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2742770, now seen corresponding path program 1 times [2024-11-02 11:26:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030766044] [2024-11-02 11:26:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:57,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030766044] [2024-11-02 11:26:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030766044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:57,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:26:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338822994] [2024-11-02 11:26:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:57,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:26:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:26:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:26:57,416 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-02 11:26:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:57,504 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2024-11-02 11:26:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:26:57,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-02 11:26:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:57,506 INFO L225 Difference]: With dead ends: 35 [2024-11-02 11:26:57,506 INFO L226 Difference]: Without dead ends: 35 [2024-11-02 11:26:57,507 INFO L431 NwaCegarLoop]: 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 [2024-11-02 11:26:57,508 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:57,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-02 11:26:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-02 11:26:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 34 states have internal predecessors, (35), 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) [2024-11-02 11:26:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-02 11:26:57,514 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 4 [2024-11-02 11:26:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:57,515 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-02 11:26:57,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-02 11:26:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-02 11:26:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 11:26:57,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:57,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 11:26:57,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:26:57,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2742771, now seen corresponding path program 1 times [2024-11-02 11:26:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264831900] [2024-11-02 11:26:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:57,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264831900] [2024-11-02 11:26:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264831900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:57,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:57,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:26:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676756803] [2024-11-02 11:26:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:57,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:26:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:26:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:26:57,743 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-02 11:26:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:57,834 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-11-02 11:26:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:26:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-02 11:26:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:57,835 INFO L225 Difference]: With dead ends: 33 [2024-11-02 11:26:57,835 INFO L226 Difference]: Without dead ends: 33 [2024-11-02 11:26:57,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:26:57,837 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:57,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-02 11:26:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-02 11:26:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 32 states have internal predecessors, (33), 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) [2024-11-02 11:26:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-02 11:26:57,846 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 4 [2024-11-02 11:26:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:57,847 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-11-02 11:26:57,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-02 11:26:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-02 11:26:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 11:26:57,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:57,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 11:26:57,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:26:57,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:57,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1659164406, now seen corresponding path program 1 times [2024-11-02 11:26:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:57,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451788097] [2024-11-02 11:26:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:57,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:57,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451788097] [2024-11-02 11:26:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451788097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:57,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:26:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720483238] [2024-11-02 11:26:57,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:57,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:57,930 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-02 11:26:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:57,993 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-11-02 11:26:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:57,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-02 11:26:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:57,995 INFO L225 Difference]: With dead ends: 29 [2024-11-02 11:26:57,995 INFO L226 Difference]: Without dead ends: 29 [2024-11-02 11:26:57,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:57,997 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:58,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-02 11:26:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-02 11:26:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 28 states have internal predecessors, (29), 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) [2024-11-02 11:26:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-11-02 11:26:58,008 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 6 [2024-11-02 11:26:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:58,009 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-11-02 11:26:58,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-02 11:26:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-11-02 11:26:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 11:26:58,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:58,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 11:26:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:26:58,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1659164405, now seen corresponding path program 1 times [2024-11-02 11:26:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:58,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579507300] [2024-11-02 11:26:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:58,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579507300] [2024-11-02 11:26:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579507300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:58,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:58,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:26:58,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162366076] [2024-11-02 11:26:58,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:58,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:58,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:58,131 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-02 11:26:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:58,172 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-02 11:26:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-02 11:26:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:58,174 INFO L225 Difference]: With dead ends: 25 [2024-11-02 11:26:58,174 INFO L226 Difference]: Without dead ends: 25 [2024-11-02 11:26:58,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:58,176 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:58,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 11:26:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-02 11:26:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-02 11:26:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 24 states have internal predecessors, (25), 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) [2024-11-02 11:26:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-02 11:26:58,180 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 6 [2024-11-02 11:26:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:58,180 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-02 11:26:58,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-02 11:26:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-02 11:26:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-02 11:26:58,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:58,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:58,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 11:26:58,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:58,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1664331593, now seen corresponding path program 1 times [2024-11-02 11:26:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119078469] [2024-11-02 11:26:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:58,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119078469] [2024-11-02 11:26:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119078469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:58,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:58,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 11:26:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136636654] [2024-11-02 11:26:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:58,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 11:26:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 11:26:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:26:58,536 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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) [2024-11-02 11:26:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:58,660 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-02 11:26:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:26:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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 [2024-11-02 11:26:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:58,661 INFO L225 Difference]: With dead ends: 24 [2024-11-02 11:26:58,661 INFO L226 Difference]: Without dead ends: 24 [2024-11-02 11:26:58,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:26:58,665 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:58,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-02 11:26:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-02 11:26:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 23 states have internal predecessors, (24), 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) [2024-11-02 11:26:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-02 11:26:58,672 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2024-11-02 11:26:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:58,672 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-02 11:26:58,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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) [2024-11-02 11:26:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-02 11:26:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 11:26:58,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:58,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:58,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 11:26:58,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash 54670366, now seen corresponding path program 1 times [2024-11-02 11:26:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753431666] [2024-11-02 11:26:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:59,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753431666] [2024-11-02 11:26:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753431666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-02 11:26:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762438918] [2024-11-02 11:26:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-02 11:26:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-02 11:26:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:26:59,236 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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) [2024-11-02 11:26:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:59,435 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-11-02 11:26:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-02 11:26:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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 12 [2024-11-02 11:26:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:59,436 INFO L225 Difference]: With dead ends: 24 [2024-11-02 11:26:59,436 INFO L226 Difference]: Without dead ends: 24 [2024-11-02 11:26:59,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-02 11:26:59,437 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:59,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:26:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-02 11:26:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-02 11:26:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 23 states have internal predecessors, (23), 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) [2024-11-02 11:26:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2024-11-02 11:26:59,444 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 12 [2024-11-02 11:26:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:59,444 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2024-11-02 11:26:59,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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) [2024-11-02 11:26:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2024-11-02 11:26:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 11:26:59,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:59,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 11:26:59,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:26:59,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash 54671903, now seen corresponding path program 1 times [2024-11-02 11:26:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:59,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707098734] [2024-11-02 11:26:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:59,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707098734] [2024-11-02 11:26:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707098734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:59,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 11:26:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748954388] [2024-11-02 11:26:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:59,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 11:26:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 11:26:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:26:59,825 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) [2024-11-02 11:26:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:59,989 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2024-11-02 11:26:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:26:59,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 12 [2024-11-02 11:26:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:59,990 INFO L225 Difference]: With dead ends: 23 [2024-11-02 11:26:59,990 INFO L226 Difference]: Without dead ends: 23 [2024-11-02 11:26:59,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:26:59,991 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:59,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-02 11:26:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-02 11:26:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 22 states have internal predecessors, (22), 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) [2024-11-02 11:26:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2024-11-02 11:26:59,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 12 [2024-11-02 11:26:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:59,998 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2024-11-02 11:26:59,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) [2024-11-02 11:26:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-11-02 11:26:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 11:26:59,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:59,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:00,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 11:27:00,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:27:00,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1694829067, now seen corresponding path program 1 times [2024-11-02 11:27:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085174939] [2024-11-02 11:27:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:00,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085174939] [2024-11-02 11:27:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085174939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 11:27:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297320893] [2024-11-02 11:27:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:00,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 11:27:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 11:27:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:27:00,480 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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) [2024-11-02 11:27:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:00,601 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-11-02 11:27:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:27:00,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 [2024-11-02 11:27:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:00,602 INFO L225 Difference]: With dead ends: 22 [2024-11-02 11:27:00,602 INFO L226 Difference]: Without dead ends: 22 [2024-11-02 11:27:00,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:27:00,603 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:00,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-02 11:27:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-02 11:27:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 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) [2024-11-02 11:27:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2024-11-02 11:27:00,608 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 13 [2024-11-02 11:27:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:00,610 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2024-11-02 11:27:00,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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) [2024-11-02 11:27:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-11-02 11:27:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-02 11:27:00,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:00,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:00,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 11:27:00,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:27:00,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1000093601, now seen corresponding path program 1 times [2024-11-02 11:27:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496679019] [2024-11-02 11:27:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:00,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:00,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496679019] [2024-11-02 11:27:00,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496679019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:00,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:00,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:27:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345146688] [2024-11-02 11:27:00,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:00,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 11:27:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 11:27:00,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:27:00,863 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2024-11-02 11:27:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:00,933 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-02 11:27:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:27:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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 [2024-11-02 11:27:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:00,934 INFO L225 Difference]: With dead ends: 21 [2024-11-02 11:27:00,934 INFO L226 Difference]: Without dead ends: 21 [2024-11-02 11:27:00,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:27:00,935 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:00,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-02 11:27:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-02 11:27:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 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) [2024-11-02 11:27:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-11-02 11:27:00,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 14 [2024-11-02 11:27:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:00,939 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-11-02 11:27:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2024-11-02 11:27:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-02 11:27:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 11:27:00,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:00,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 11:27:00,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:27:00,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash 938130637, now seen corresponding path program 1 times [2024-11-02 11:27:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269769623] [2024-11-02 11:27:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:01,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269769623] [2024-11-02 11:27:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269769623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:01,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:01,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:27:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548387052] [2024-11-02 11:27:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:01,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 11:27:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:01,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 11:27:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:27:01,163 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2024-11-02 11:27:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:01,232 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-11-02 11:27:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:27:01,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 [2024-11-02 11:27:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:01,234 INFO L225 Difference]: With dead ends: 20 [2024-11-02 11:27:01,234 INFO L226 Difference]: Without dead ends: 20 [2024-11-02 11:27:01,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:27:01,235 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:01,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-02 11:27:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-02 11:27:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 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) [2024-11-02 11:27:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2024-11-02 11:27:01,237 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 15 [2024-11-02 11:27:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:01,238 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2024-11-02 11:27:01,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2024-11-02 11:27:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-11-02 11:27:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-02 11:27:01,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:01,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 11:27:01,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:27:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash -982721245, now seen corresponding path program 1 times [2024-11-02 11:27:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458177656] [2024-11-02 11:27:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:01,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458177656] [2024-11-02 11:27:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458177656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-02 11:27:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686081005] [2024-11-02 11:27:01,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:01,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-02 11:27:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-02 11:27:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-02 11:27:01,721 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) [2024-11-02 11:27:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:01,905 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-02 11:27:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-02 11:27:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 16 [2024-11-02 11:27:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:01,906 INFO L225 Difference]: With dead ends: 19 [2024-11-02 11:27:01,907 INFO L226 Difference]: Without dead ends: 19 [2024-11-02 11:27:01,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-02 11:27:01,908 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:01,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-02 11:27:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-02 11:27:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 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) [2024-11-02 11:27:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2024-11-02 11:27:01,913 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 16 [2024-11-02 11:27:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2024-11-02 11:27:01,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) [2024-11-02 11:27:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-11-02 11:27:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-02 11:27:01,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:01,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:01,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 11:27:01,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-02 11:27:01,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash 497691302, now seen corresponding path program 1 times [2024-11-02 11:27:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593852374] [2024-11-02 11:27:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:27:03,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:03,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593852374] [2024-11-02 11:27:03,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593852374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:03,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:03,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-02 11:27:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363482553] [2024-11-02 11:27:03,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:04,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-02 11:27:04,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:04,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-02 11:27:04,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-02 11:27:04,001 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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) [2024-11-02 11:27:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:04,535 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2024-11-02 11:27:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-02 11:27:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 18 [2024-11-02 11:27:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:04,536 INFO L225 Difference]: With dead ends: 18 [2024-11-02 11:27:04,536 INFO L226 Difference]: Without dead ends: 0 [2024-11-02 11:27:04,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-11-02 11:27:04,537 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:27:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-02 11:27:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-02 11:27:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2024-11-02 11:27:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-02 11:27:04,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-11-02 11:27:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:04,539 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-02 11:27:04,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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) [2024-11-02 11:27:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-02 11:27:04,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-02 11:27:04,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-11-02 11:27:04,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-02 11:27:04,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-02 11:27:04,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-02 11:27:04,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-02 11:27:04,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-02 11:27:04,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-02 11:27:04,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-02 11:27:04,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-02 11:27:04,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-02 11:27:04,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-02 11:27:04,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-11-02 11:27:04,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-11-02 11:27:04,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-11-02 11:27:04,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-11-02 11:27:04,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-11-02 11:27:04,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2024-11-02 11:27:04,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2024-11-02 11:27:04,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-02 11:27:04,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-02 11:27:04,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-02 11:27:04,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2024-11-02 11:27:04,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-11-02 11:27:04,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 11:27:04,551 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:04,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 11:27:04,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:27:04 BoogieIcfgContainer [2024-11-02 11:27:04,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 11:27:04,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 11:27:04,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 11:27:04,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 11:27:04,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:55" (3/4) ... [2024-11-02 11:27:04,561 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-02 11:27:04,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-02 11:27:04,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-02 11:27:04,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-02 11:27:04,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-02 11:27:04,657 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 11:27:04,658 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/witness.yml [2024-11-02 11:27:04,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 11:27:04,658 INFO L158 Benchmark]: Toolchain (without parser) took 9893.31ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 115.8MB in the beginning and 132.6MB in the end (delta: -16.8MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,659 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 155.2MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 11:27:04,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.16ms. Allocated memory is still 155.2MB. Free memory was 115.3MB in the beginning and 96.4MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.34ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 94.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,660 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 155.2MB. Free memory was 94.8MB in the beginning and 93.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,660 INFO L158 Benchmark]: RCFGBuilder took 575.57ms. Allocated memory is still 155.2MB. Free memory was 93.2MB in the beginning and 74.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,661 INFO L158 Benchmark]: TraceAbstraction took 8580.80ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 74.3MB in the beginning and 136.8MB in the end (delta: -62.4MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,661 INFO L158 Benchmark]: Witness Printer took 100.41ms. Allocated memory is still 243.3MB. Free memory was 136.8MB in the beginning and 132.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-02 11:27:04,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 155.2MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.16ms. Allocated memory is still 155.2MB. Free memory was 115.3MB in the beginning and 96.4MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.34ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 94.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 155.2MB. Free memory was 94.8MB in the beginning and 93.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.57ms. Allocated memory is still 155.2MB. Free memory was 93.2MB in the beginning and 74.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8580.80ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 74.3MB in the beginning and 136.8MB in the end (delta: -62.4MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Witness Printer took 100.41ms. Allocated memory is still 243.3MB. Free memory was 136.8MB in the beginning and 132.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 587 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1151 IncrementalHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 194 mSDtfsCounter, 1151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 104, 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, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-02 11:27:04,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e84276c-55a1-494f-bfc2-9e9344572609/bin/utaipan-verify-DbMuA5NWw2/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 Result: TRUE