./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/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_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/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_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:29:59,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:29:59,168 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 12:29:59,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:29:59,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:29:59,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:29:59,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:29:59,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:29:59,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:29:59,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:29:59,211 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:29:59,212 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:29:59,213 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:29:59,213 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:29:59,213 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:29:59,214 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:29:59,214 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:29:59,215 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:29:59,215 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:29:59,216 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:29:59,218 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:29:59,222 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:29:59,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:29:59,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:29:59,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:29:59,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:29:59,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:29:59,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:29:59,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:29:59,225 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:29:59,226 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:29:59,226 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:29:59,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:29:59,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:29:59,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:29:59,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:29:59,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:29:59,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:29:59,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:29:59,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:29:59,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:29:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:29:59,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:29:59,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:29:59,232 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:29:59,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:29:59,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:29:59,233 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:29:59,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:29:59,233 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_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/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_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-02 12:29:59,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:29:59,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:29:59,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:29:59,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:29:59,605 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:29:59,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i Unable to find full path for "g++" [2024-11-02 12:30:01,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:30:01,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:30:01,868 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-02 12:30:01,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/data/7f9c5211b/cd08485928cd489d834bab5e7851dba5/FLAG5398f3b1d [2024-11-02 12:30:02,192 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/data/7f9c5211b/cd08485928cd489d834bab5e7851dba5 [2024-11-02 12:30:02,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:30:02,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:30:02,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:30:02,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:30:02,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:30:02,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ff068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02, skipping insertion in model container [2024-11-02 12:30:02,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:30:02,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:30:02,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:30:02,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:30:02,781 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:30:02,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02 WrapperNode [2024-11-02 12:30:02,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:30:02,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:30:02,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:30:02,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:30:02,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,830 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 110 [2024-11-02 12:30:02,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:30:02,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:30:02,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:30:02,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:30:02,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:30:02,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:30:02,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:30:02,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:30:02,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (1/1) ... [2024-11-02 12:30:02,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:30:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:02,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:30:02,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:30:02,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 12:30:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 12:30:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-02 12:30:02,997 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-02 12:30:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 12:30:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:30:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 12:30:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 12:30:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 12:30:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:30:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-02 12:30:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:30:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:30:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:30:03,221 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:30:03,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:30:03,613 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-02 12:30:03,614 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:30:03,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:30:03,691 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-02 12:30:03,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:03 BoogieIcfgContainer [2024-11-02 12:30:03,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:30:03,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:30:03,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:30:03,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:30:03,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:30:02" (1/3) ... [2024-11-02 12:30:03,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f2c495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:03, skipping insertion in model container [2024-11-02 12:30:03,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:02" (2/3) ... [2024-11-02 12:30:03,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f2c495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:03, skipping insertion in model container [2024-11-02 12:30:03,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:03" (3/3) ... [2024-11-02 12:30:03,702 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-02 12:30:03,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:30:03,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-11-02 12:30:03,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:30:03,791 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;@3cacfbdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:30:03,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-02 12:30:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 12:30:03,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:03,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 12:30:03,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:03,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 745068317, now seen corresponding path program 1 times [2024-11-02 12:30:03,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:03,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664957692] [2024-11-02 12:30:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:04,076 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 12:30:04,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664957692] [2024-11-02 12:30:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664957692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:04,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:04,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:30:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581774451] [2024-11-02 12:30:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:04,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:04,136 INFO L87 Difference]: Start difference. First operand has 61 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:04,252 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-02 12:30:04,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:04,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 12:30:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:04,262 INFO L225 Difference]: With dead ends: 66 [2024-11-02 12:30:04,263 INFO L226 Difference]: Without dead ends: 64 [2024-11-02 12:30:04,265 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 12:30:04,271 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:04,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-02 12:30:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-02 12:30:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-11-02 12:30:04,330 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 6 [2024-11-02 12:30:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:04,330 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-11-02 12:30:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-11-02 12:30:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 12:30:04,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:04,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 12:30:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:30:04,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:04,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash 613868753, now seen corresponding path program 1 times [2024-11-02 12:30:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799340690] [2024-11-02 12:30:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:04,455 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 12:30:04,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799340690] [2024-11-02 12:30:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799340690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:30:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260287053] [2024-11-02 12:30:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:04,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:04,461 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:04,546 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-11-02 12:30:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:04,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 12:30:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:04,548 INFO L225 Difference]: With dead ends: 57 [2024-11-02 12:30:04,548 INFO L226 Difference]: Without dead ends: 57 [2024-11-02 12:30:04,549 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 12:30:04,550 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:04,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-02 12:30:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-02 12:30:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-02 12:30:04,559 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 6 [2024-11-02 12:30:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:04,565 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-02 12:30:04,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-02 12:30:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 12:30:04,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:04,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 12:30:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:30:04,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:04,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 613868754, now seen corresponding path program 1 times [2024-11-02 12:30:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:04,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180770480] [2024-11-02 12:30:04,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:04,868 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 12:30:04,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180770480] [2024-11-02 12:30:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180770480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:30:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381792988] [2024-11-02 12:30:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:04,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:04,872 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:04,963 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-02 12:30:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 12:30:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:04,966 INFO L225 Difference]: With dead ends: 55 [2024-11-02 12:30:04,966 INFO L226 Difference]: Without dead ends: 55 [2024-11-02 12:30:04,967 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 12:30:04,968 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:04,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-02 12:30:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-02 12:30:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.896551724137931) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-11-02 12:30:04,976 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2024-11-02 12:30:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-02 12:30:04,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-11-02 12:30:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 12:30:04,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:04,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:30:04,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2109947805, now seen corresponding path program 1 times [2024-11-02 12:30:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966556551] [2024-11-02 12:30:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:05,169 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 12:30:05,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:05,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966556551] [2024-11-02 12:30:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966556551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:05,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46921301] [2024-11-02 12:30:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:05,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:05,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:05,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:05,173 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:30:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:05,345 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-11-02 12:30:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:05,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-02 12:30:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:05,348 INFO L225 Difference]: With dead ends: 54 [2024-11-02 12:30:05,348 INFO L226 Difference]: Without dead ends: 54 [2024-11-02 12:30:05,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:05,349 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:05,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:30:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-02 12:30:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-02 12:30:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-02 12:30:05,362 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2024-11-02 12:30:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:05,363 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-02 12:30:05,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:30:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-02 12:30:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 12:30:05,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:05,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:05,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:30:05,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2109947804, now seen corresponding path program 1 times [2024-11-02 12:30:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084651959] [2024-11-02 12:30:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:05,574 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 12:30:05,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084651959] [2024-11-02 12:30:05,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084651959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303289760] [2024-11-02 12:30:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:05,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:05,578 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:30:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:05,726 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-11-02 12:30:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-02 12:30:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:05,728 INFO L225 Difference]: With dead ends: 53 [2024-11-02 12:30:05,728 INFO L226 Difference]: Without dead ends: 53 [2024-11-02 12:30:05,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:05,729 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:05,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-02 12:30:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-02 12:30:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-02 12:30:05,742 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2024-11-02 12:30:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:05,743 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-02 12:30:05,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:30:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-02 12:30:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-02 12:30:05,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:05,744 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:05,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:30:05,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1051956983, now seen corresponding path program 1 times [2024-11-02 12:30:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:05,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567736959] [2024-11-02 12:30:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:30:05,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567736959] [2024-11-02 12:30:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567736959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215014334] [2024-11-02 12:30:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:05,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:05,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:05,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:30:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:06,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 12:30:06,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:06,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:30:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:30:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215014334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:30:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2010231832] [2024-11-02 12:30:06,219 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-02 12:30:06,219 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:30:06,225 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:30:06,231 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:30:06,232 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:30:08,347 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 136 for LOIs [2024-11-02 12:30:08,937 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:30:17,803 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '760#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_19| Int)) (and (or (and (exists ((|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_47| (store |v_#memory_int_46| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_46| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#valid_76| (Array Int Int))) (and (= |#valid| (store |v_#valid_76| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_76| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_9| (Array Int Int)) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_int)_AFTER_CALL_9|))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_61| (Array Int Int))) (= |#length| (store |v_#length_61| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8)))) (and (exists ((|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_47| (store |v_#memory_int_46| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_46| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_47| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#valid_76| (Array Int Int))) (and (= |#valid| (store |v_#valid_76| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_76| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_60| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_19| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_17| (Array Int Int)) (|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_17| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_$Pointer$.base_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#length_61| (Array Int Int))) (= |#length| (store |v_#length_61| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_prepend_~head#1.base_19|) 1)))) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-02 12:30:17,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:30:17,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:30:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-02 12:30:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685465250] [2024-11-02 12:30:17,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:30:17,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=207, Unknown=1, NotChecked=0, Total=240 [2024-11-02 12:30:17,808 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-02 12:30:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:17,869 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-02 12:30:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-02 12:30:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:17,870 INFO L225 Difference]: With dead ends: 57 [2024-11-02 12:30:17,871 INFO L226 Difference]: Without dead ends: 57 [2024-11-02 12:30:17,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=32, Invalid=207, Unknown=1, NotChecked=0, Total=240 [2024-11-02 12:30:17,872 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:17,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-02 12:30:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-02 12:30:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.75) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-02 12:30:17,878 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 19 [2024-11-02 12:30:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:17,879 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-02 12:30:17,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-02 12:30:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-02 12:30:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 12:30:17,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:17,880 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:17,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 12:30:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:18,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1948615503, now seen corresponding path program 2 times [2024-11-02 12:30:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186512282] [2024-11-02 12:30:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-02 12:30:18,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186512282] [2024-11-02 12:30:18,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186512282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:18,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729106163] [2024-11-02 12:30:18,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-02 12:30:18,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:18,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:18,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:18,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:30:18,860 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-02 12:30:18,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-02 12:30:18,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-02 12:30:18,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:18,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 12:30:18,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 12:30:19,005 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-02 12:30:19,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-02 12:30:19,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 12:30:19,117 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-02 12:30:19,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:30:19,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 12:30:19,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 12:30:19,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:30:19,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 12:30:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2024-11-02 12:30:19,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:30:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729106163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545018216] [2024-11-02 12:30:19,341 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-02 12:30:19,341 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:30:19,341 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:30:19,342 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:30:19,342 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:30:20,396 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 115 for LOIs [2024-11-02 12:30:20,859 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:30:26,533 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '993#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_20| Int)) (and (or (and (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#length_68| (Array Int Int))) (= |#length| (store |v_#length_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_58| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= |v_#memory_int_59| (store |v_#memory_int_58| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_58| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))))) (exists ((|v_#valid_89| (Array Int Int))) (and (= (store |v_#valid_89| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_89| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_33| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0)))))) (and (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#length_68| (Array Int Int))) (= |#length| (store |v_#length_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_58| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= |v_#memory_int_59| (store |v_#memory_int_58| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_58| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))))) (exists ((|v_#valid_89| (Array Int Int))) (and (= (store |v_#valid_89| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_89| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_35| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_prepend_~head#1.base_20|) 1)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-02 12:30:26,533 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:30:26,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 12:30:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-02 12:30:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956104278] [2024-11-02 12:30:26,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 12:30:26,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-02 12:30:26,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-02 12:30:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=668, Unknown=2, NotChecked=52, Total=812 [2024-11-02 12:30:26,536 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-02 12:30:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:26,907 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-11-02 12:30:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:30:26,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-11-02 12:30:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:26,909 INFO L225 Difference]: With dead ends: 63 [2024-11-02 12:30:26,909 INFO L226 Difference]: Without dead ends: 63 [2024-11-02 12:30:26,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=116, Invalid=816, Unknown=2, NotChecked=58, Total=992 [2024-11-02 12:30:26,910 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 112 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:26,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 139 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2024-11-02 12:30:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-02 12:30:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-11-02 12:30:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-02 12:30:26,919 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 28 [2024-11-02 12:30:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:26,920 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-02 12:30:26,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-02 12:30:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-02 12:30:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 12:30:26,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:26,921 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:26,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-02 12:30:27,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:27,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:27,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1948615502, now seen corresponding path program 1 times [2024-11-02 12:30:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:27,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015462187] [2024-11-02 12:30:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 12:30:27,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015462187] [2024-11-02 12:30:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015462187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111204479] [2024-11-02 12:30:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:27,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:27,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:27,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 12:30:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:28,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-02 12:30:28,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:28,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-02 12:30:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 12:30:28,150 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-02 12:30:28,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:30:28,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 12:30:28,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 12:30:28,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:30:28,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 12:30:28,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 12:30:28,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:30:28,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 12:30:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-02 12:30:28,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:30:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111204479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:30:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-02 12:30:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667999176] [2024-11-02 12:30:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:28,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:30:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:30:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-11-02 12:30:28,390 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:28,505 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-02 12:30:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:30:28,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-02 12:30:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:28,507 INFO L225 Difference]: With dead ends: 51 [2024-11-02 12:30:28,507 INFO L226 Difference]: Without dead ends: 51 [2024-11-02 12:30:28,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-11-02 12:30:28,508 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:28,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2024-11-02 12:30:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-02 12:30:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-02 12:30:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-02 12:30:28,513 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 28 [2024-11-02 12:30:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:28,513 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-02 12:30:28,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-02 12:30:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-02 12:30:28,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:28,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:28,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-02 12:30:28,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:28,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -277538448, now seen corresponding path program 1 times [2024-11-02 12:30:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641835817] [2024-11-02 12:30:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-02 12:30:28,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:28,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641835817] [2024-11-02 12:30:28,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641835817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:28,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:28,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489896365] [2024-11-02 12:30:28,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:28,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:28,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:28,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:28,966 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:30:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:29,085 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-02 12:30:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-02 12:30:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:29,087 INFO L225 Difference]: With dead ends: 50 [2024-11-02 12:30:29,087 INFO L226 Difference]: Without dead ends: 50 [2024-11-02 12:30:29,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:29,088 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:29,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-02 12:30:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-02 12:30:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.53125) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-02 12:30:29,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 29 [2024-11-02 12:30:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:29,098 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-02 12:30:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:30:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-02 12:30:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-02 12:30:29,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:29,106 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:29,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:30:29,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -277538449, now seen corresponding path program 1 times [2024-11-02 12:30:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488654847] [2024-11-02 12:30:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-02 12:30:29,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488654847] [2024-11-02 12:30:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488654847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065220092] [2024-11-02 12:30:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:29,251 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:30:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:29,364 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-02 12:30:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-02 12:30:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:29,365 INFO L225 Difference]: With dead ends: 49 [2024-11-02 12:30:29,365 INFO L226 Difference]: Without dead ends: 49 [2024-11-02 12:30:29,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:29,367 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:29,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 120 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-02 12:30:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-02 12:30:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.5) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-02 12:30:29,376 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2024-11-02 12:30:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-02 12:30:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:30:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-02 12:30:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-02 12:30:29,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:29,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:29,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:30:29,378 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -426369898, now seen corresponding path program 1 times [2024-11-02 12:30:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:29,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203785483] [2024-11-02 12:30:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-02 12:30:29,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:29,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203785483] [2024-11-02 12:30:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203785483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 12:30:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532882147] [2024-11-02 12:30:29,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:29,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:30:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:29,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:30:29,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:29,674 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:29,756 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-02 12:30:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-02 12:30:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:29,760 INFO L225 Difference]: With dead ends: 47 [2024-11-02 12:30:29,760 INFO L226 Difference]: Without dead ends: 47 [2024-11-02 12:30:29,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:30:29,761 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:29,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 72 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-02 12:30:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-02 12:30:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.4375) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-02 12:30:29,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 31 [2024-11-02 12:30:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:29,768 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-02 12:30:29,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-02 12:30:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 12:30:29,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:29,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:29,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 12:30:29,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:29,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1719484968, now seen corresponding path program 1 times [2024-11-02 12:30:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446747551] [2024-11-02 12:30:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-02 12:30:30,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:30,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446747551] [2024-11-02 12:30:30,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446747551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:30,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-02 12:30:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351051248] [2024-11-02 12:30:30,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:30,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 12:30:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 12:30:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:30:30,063 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:30,257 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-11-02 12:30:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 12:30:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-02 12:30:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:30,259 INFO L225 Difference]: With dead ends: 48 [2024-11-02 12:30:30,259 INFO L226 Difference]: Without dead ends: 48 [2024-11-02 12:30:30,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-02 12:30:30,260 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:30,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 107 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:30:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-02 12:30:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-02 12:30:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-02 12:30:30,271 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 33 [2024-11-02 12:30:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:30,271 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-02 12:30:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-02 12:30:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 12:30:30,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:30,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:30,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 12:30:30,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1719484967, now seen corresponding path program 1 times [2024-11-02 12:30:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:30,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996404701] [2024-11-02 12:30:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-02 12:30:30,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:30,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996404701] [2024-11-02 12:30:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996404701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:30,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-02 12:30:30,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831421904] [2024-11-02 12:30:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:30,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 12:30:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 12:30:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:30:30,770 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:30,919 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-02 12:30:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 12:30:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-02 12:30:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:30,921 INFO L225 Difference]: With dead ends: 49 [2024-11-02 12:30:30,921 INFO L226 Difference]: Without dead ends: 49 [2024-11-02 12:30:30,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-02 12:30:30,922 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:30,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 123 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-02 12:30:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-02 12:30:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.4) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-02 12:30:30,926 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 33 [2024-11-02 12:30:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-02 12:30:30,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-11-02 12:30:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 12:30:30,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:30,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:30,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 12:30:30,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:30,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash 990262400, now seen corresponding path program 1 times [2024-11-02 12:30:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744111231] [2024-11-02 12:30:30,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-02 12:30:31,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744111231] [2024-11-02 12:30:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744111231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:31,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-02 12:30:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302418682] [2024-11-02 12:30:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 12:30:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 12:30:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:30:31,161 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:31,281 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-02 12:30:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 12:30:31,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-02 12:30:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:31,282 INFO L225 Difference]: With dead ends: 49 [2024-11-02 12:30:31,282 INFO L226 Difference]: Without dead ends: 49 [2024-11-02 12:30:31,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-02 12:30:31,283 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:31,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 171 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-02 12:30:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-02 12:30:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-02 12:30:31,287 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 36 [2024-11-02 12:30:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:31,288 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-02 12:30:31,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-02 12:30:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-02 12:30:31,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:31,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 12:30:31,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-02 12:30:31,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2132087843, now seen corresponding path program 1 times [2024-11-02 12:30:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:31,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749130984] [2024-11-02 12:30:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:30:32,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749130984] [2024-11-02 12:30:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749130984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764539796] [2024-11-02 12:30:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:32,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:32,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_636d3a77-f58b-4a41-90ad-4bea8d3a38b3/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-02 12:30:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:32,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-02 12:30:32,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:32,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 12:30:32,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-02 12:30:33,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:30:33,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-02 12:30:33,032 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-02 12:30:33,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21