./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:28:52,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:28:53,057 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 20:28:53,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:28:53,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:28:53,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:28:53,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:28:53,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:28:53,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:28:53,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:28:53,120 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:28:53,121 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:28:53,122 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:28:53,122 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:28:53,123 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:28:53,123 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:28:53,124 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:28:53,124 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:28:53,125 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:28:53,126 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:28:53,126 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:28:53,127 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:28:53,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:28:53,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:28:53,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:28:53,129 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:28:53,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:28:53,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:28:53,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:28:53,131 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:28:53,131 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:28:53,132 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:28:53,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:28:53,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:28:53,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:28:53,143 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:28:53,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:28:53,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:28:53,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:28:53,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:28:53,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:28:53,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:28:53,146 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:28:53,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:28:53,146 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:28:53,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:28:53,146 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_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/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_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-11-06 20:28:53,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:28:53,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:28:53,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:28:53,490 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:28:53,498 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:28:53,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-06 20:28:56,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:28:56,856 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:28:56,857 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-06 20:28:56,881 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/data/40c05f93f/64ab1fa23b6d406db86dce484695c418/FLAGe5ca5f675 [2023-11-06 20:28:56,896 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/data/40c05f93f/64ab1fa23b6d406db86dce484695c418 [2023-11-06 20:28:56,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:28:56,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:28:56,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:28:56,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:28:56,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:28:56,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:28:56" (1/1) ... [2023-11-06 20:28:56,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e944ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:56, skipping insertion in model container [2023-11-06 20:28:56,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:28:56" (1/1) ... [2023-11-06 20:28:56,976 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:28:57,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:28:57,287 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:28:57,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:28:57,372 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:28:57,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57 WrapperNode [2023-11-06 20:28:57,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:28:57,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:28:57,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:28:57,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:28:57,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,445 INFO L138 Inliner]: procedures = 127, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2023-11-06 20:28:57,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:28:57,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:28:57,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:28:57,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:28:57,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:28:57,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:28:57,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:28:57,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:28:57,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (1/1) ... [2023-11-06 20:28:57,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:28:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:28:57,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:28:57,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:28:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:28:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:28:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 20:28:57,628 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 20:28:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:28:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:28:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:28:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:28:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:28:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:28:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 20:28:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:28:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:28:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:28:57,767 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:28:57,768 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:28:58,188 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:28:58,250 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:28:58,250 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 20:28:58,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:28:58 BoogieIcfgContainer [2023-11-06 20:28:58,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:28:58,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:28:58,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:28:58,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:28:58,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:28:56" (1/3) ... [2023-11-06 20:28:58,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2756674c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:28:58, skipping insertion in model container [2023-11-06 20:28:58,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:28:57" (2/3) ... [2023-11-06 20:28:58,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2756674c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:28:58, skipping insertion in model container [2023-11-06 20:28:58,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:28:58" (3/3) ... [2023-11-06 20:28:58,263 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-11-06 20:28:58,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:28:58,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-06 20:28:58,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:28:58,344 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f1147de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:28:58,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-06 20:28:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 69 states have internal predecessors, (79), 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) [2023-11-06 20:28:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:28:58,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:58,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:28:58,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:28:58,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1573405085, now seen corresponding path program 1 times [2023-11-06 20:28:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:58,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220294778] [2023-11-06 20:28:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:28:58,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220294778] [2023-11-06 20:28:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220294778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:58,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:28:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223299458] [2023-11-06 20:28:58,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:28:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:28:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:28:58,820 INFO L87 Difference]: Start difference. First operand has 73 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 69 states have internal predecessors, (79), 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) [2023-11-06 20:28:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:58,885 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-06 20:28:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:28:58,888 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 [2023-11-06 20:28:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:58,896 INFO L225 Difference]: With dead ends: 78 [2023-11-06 20:28:58,896 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 20:28:58,898 INFO L412 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 [2023-11-06 20:28:58,902 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:58,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:28:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 20:28:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-06 20:28:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 2.085714285714286) internal successors, (73), 67 states have internal predecessors, (73), 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) [2023-11-06 20:28:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-06 20:28:58,947 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 6 [2023-11-06 20:28:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:58,948 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-06 20:28:58,948 INFO L496 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) [2023-11-06 20:28:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-06 20:28:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:28:58,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:58,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:28:58,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:28:58,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:28:58,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1416346933, now seen corresponding path program 1 times [2023-11-06 20:28:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649178857] [2023-11-06 20:28:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:28:59,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649178857] [2023-11-06 20:28:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649178857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:28:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549483442] [2023-11-06 20:28:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:28:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:28:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:28:59,020 INFO L87 Difference]: Start difference. First operand 71 states and 77 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) [2023-11-06 20:28:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:59,112 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-11-06 20:28:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:28:59,113 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 [2023-11-06 20:28:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:59,115 INFO L225 Difference]: With dead ends: 69 [2023-11-06 20:28:59,115 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 20:28:59,115 INFO L412 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 [2023-11-06 20:28:59,117 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:59,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:28:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 20:28:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-06 20:28:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 65 states have internal predecessors, (71), 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) [2023-11-06 20:28:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-11-06 20:28:59,128 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 6 [2023-11-06 20:28:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:59,129 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-11-06 20:28:59,129 INFO L496 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) [2023-11-06 20:28:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-11-06 20:28:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:28:59,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:59,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:28:59,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:28:59,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:28:59,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1416346934, now seen corresponding path program 1 times [2023-11-06 20:28:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470308581] [2023-11-06 20:28:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:28:59,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470308581] [2023-11-06 20:28:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470308581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:28:59,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599331924] [2023-11-06 20:28:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:59,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:28:59,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:59,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:28:59,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:28:59,312 INFO L87 Difference]: Start difference. First operand 69 states and 75 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) [2023-11-06 20:28:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:59,440 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-11-06 20:28:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:28:59,441 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 [2023-11-06 20:28:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:59,445 INFO L225 Difference]: With dead ends: 67 [2023-11-06 20:28:59,446 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 20:28:59,447 INFO L412 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 [2023-11-06 20:28:59,456 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:59,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:28:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 20:28:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-06 20:28:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 63 states have internal predecessors, (69), 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) [2023-11-06 20:28:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-11-06 20:28:59,474 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 6 [2023-11-06 20:28:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:59,475 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-11-06 20:28:59,475 INFO L496 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) [2023-11-06 20:28:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-11-06 20:28:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:28:59,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:59,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:28:59,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:28:59,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:28:59,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1854972271, now seen corresponding path program 1 times [2023-11-06 20:28:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138896396] [2023-11-06 20:28:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:28:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:28:59,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:28:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138896396] [2023-11-06 20:28:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138896396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:28:59,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:28:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:28:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414993539] [2023-11-06 20:28:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:28:59,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:28:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:28:59,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:28:59,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:28:59,693 INFO L87 Difference]: Start difference. First operand 67 states and 73 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) [2023-11-06 20:28:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:28:59,901 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2023-11-06 20:28:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:28:59,902 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 [2023-11-06 20:28:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:28:59,907 INFO L225 Difference]: With dead ends: 67 [2023-11-06 20:28:59,908 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 20:28:59,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:28:59,919 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:28:59,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:28:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 20:28:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-11-06 20:28:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 62 states have internal predecessors, (68), 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) [2023-11-06 20:28:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-11-06 20:28:59,935 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 10 [2023-11-06 20:28:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:28:59,936 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-11-06 20:28:59,936 INFO L496 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) [2023-11-06 20:28:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-11-06 20:28:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:28:59,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:28:59,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:28:59,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:28:59,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:28:59,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:28:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1854972270, now seen corresponding path program 1 times [2023-11-06 20:28:59,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:28:59,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242838671] [2023-11-06 20:28:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:28:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:28:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:00,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242838671] [2023-11-06 20:29:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242838671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:29:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:29:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988302137] [2023-11-06 20:29:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:00,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:29:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:29:00,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:29:00,221 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2023-11-06 20:29:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:00,396 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2023-11-06 20:29:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:29:00,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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 [2023-11-06 20:29:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:00,399 INFO L225 Difference]: With dead ends: 66 [2023-11-06 20:29:00,399 INFO L226 Difference]: Without dead ends: 66 [2023-11-06 20:29:00,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:29:00,400 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:00,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 223 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:29:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-06 20:29:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-11-06 20:29:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 61 states have internal predecessors, (67), 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) [2023-11-06 20:29:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-11-06 20:29:00,407 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 10 [2023-11-06 20:29:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:00,408 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-11-06 20:29:00,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2023-11-06 20:29:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-11-06 20:29:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 20:29:00,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:00,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:00,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:29:00,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:29:00,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1289069132, now seen corresponding path program 1 times [2023-11-06 20:29:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:00,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774246610] [2023-11-06 20:29:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:29:00,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774246610] [2023-11-06 20:29:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774246610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122445341] [2023-11-06 20:29:00,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:00,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:00,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:00,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:29:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:00,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:29:00,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:29:00,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:29:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:29:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122445341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:29:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604908621] [2023-11-06 20:29:00,864 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:29:00,865 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:29:00,869 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:29:00,875 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:29:00,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:29:03,554 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-06 20:29:04,183 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:29:04,203 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 1)) (.cse1 (= |c_ULTIMATE.start_sll_append_#in~head#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse2 (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (.cse3 (= |c_ULTIMATE.start_sll_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse5 (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |c_#memory_$Pointer$.base|))) (.cse6 (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (.cse7 (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_51| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))) (and (= (store |v_#memory_int_50| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select .cse12 4))) |v_#memory_int_51|) (= (store |v_#memory_int_51| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store .cse12 0 1)) |c_#memory_int|))))) (.cse8 (exists ((|v_#length_73| (Array Int Int))) (= (store |v_#length_73| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |c_#length|))) (.cse9 (exists ((|v_#valid_88| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_88| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_88| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))) (.cse10 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))) (.cse11 (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_54| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_sll_create_#res#1.base|) 1)) .cse9 (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_75| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse10 (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse11) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_54| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse4 .cse5 (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_75| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|) 1))))) (= |c_ULTIMATE.start_sll_append_#in~data#1| 1) (= |c_ULTIMATE.start_sll_append_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#in~head#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2) (<= 2 |c_ULTIMATE.start_sll_append_#in~head#1.base|)) is different from true [2023-11-06 20:29:11,625 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '899#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_append_~data#1| 1) (= 1 |ULTIMATE.start_sll_append_#in~data#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (or (and (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_73| (Array Int Int))) (= |#length| (store |v_#length_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#valid_88| (Array Int Int))) (and (= (store |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_73| (Array Int Int))) (= |#length| (store |v_#length_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_88| (Array Int Int))) (and (= (store |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))))' at error location [2023-11-06 20:29:11,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:29:11,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:29:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-06 20:29:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568343800] [2023-11-06 20:29:11,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:29:11,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:29:11,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:11,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:29:11,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=179, Unknown=3, NotChecked=26, Total=240 [2023-11-06 20:29:11,627 INFO L87 Difference]: Start difference. First operand 65 states and 71 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) [2023-11-06 20:29:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:11,672 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-11-06 20:29:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:29:11,673 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 [2023-11-06 20:29:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:11,674 INFO L225 Difference]: With dead ends: 69 [2023-11-06 20:29:11,674 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 20:29:11,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=32, Invalid=179, Unknown=3, NotChecked=26, Total=240 [2023-11-06 20:29:11,675 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:11,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:29:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 20:29:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-06 20:29:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 64 states have internal predecessors, (70), 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) [2023-11-06 20:29:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2023-11-06 20:29:11,682 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 19 [2023-11-06 20:29:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:11,682 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2023-11-06 20:29:11,683 INFO L496 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) [2023-11-06 20:29:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2023-11-06 20:29:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:29:11,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:11,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:11,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:11,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:11,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:29:11,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1236561829, now seen corresponding path program 2 times [2023-11-06 20:29:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765395716] [2023-11-06 20:29:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 20:29:12,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765395716] [2023-11-06 20:29:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765395716] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808552126] [2023-11-06 20:29:12,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:29:12,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:12,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:12,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:12,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:29:12,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 20:29:12,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:29:12,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 20:29:12,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:12,633 INFO L351 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 [2023-11-06 20:29:12,665 INFO L351 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 [2023-11-06 20:29:12,680 WARN L861 $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 [2023-11-06 20:29:12,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:12,714 INFO L351 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 [2023-11-06 20:29:12,740 INFO L351 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 [2023-11-06 20:29:12,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:12,781 INFO L351 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 [2023-11-06 20:29:12,816 INFO L351 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 [2023-11-06 20:29:12,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:12,850 INFO L351 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 [2023-11-06 20:29:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:29:12,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:29:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808552126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:29:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 20:29:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152184624] [2023-11-06 20:29:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:29:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:29:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-11-06 20:29:12,859 INFO L87 Difference]: Start difference. First operand 69 states and 76 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) [2023-11-06 20:29:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:12,989 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2023-11-06 20:29:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:29:12,989 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 [2023-11-06 20:29:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:12,990 INFO L225 Difference]: With dead ends: 66 [2023-11-06 20:29:12,990 INFO L226 Difference]: Without dead ends: 66 [2023-11-06 20:29:12,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-06 20:29:12,991 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:12,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 85 Unchecked, 0.1s Time] [2023-11-06 20:29:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-06 20:29:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-06 20:29:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.763157894736842) internal successors, (67), 61 states have internal predecessors, (67), 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) [2023-11-06 20:29:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2023-11-06 20:29:12,997 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2023-11-06 20:29:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:13,002 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2023-11-06 20:29:13,002 INFO L496 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) [2023-11-06 20:29:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2023-11-06 20:29:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:29:13,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:13,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:13,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:13,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:13,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:29:13,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1236561828, now seen corresponding path program 1 times [2023-11-06 20:29:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:13,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304867921] [2023-11-06 20:29:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:29:14,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304867921] [2023-11-06 20:29:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304867921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336044079] [2023-11-06 20:29:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:14,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:14,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:14,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:29:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:14,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 20:29:14,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:14,234 INFO L351 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 [2023-11-06 20:29:14,272 INFO L351 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 [2023-11-06 20:29:14,280 WARN L861 $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 [2023-11-06 20:29:14,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:14,315 INFO L351 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 [2023-11-06 20:29:14,351 INFO L351 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 [2023-11-06 20:29:14,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:14,383 INFO L351 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 [2023-11-06 20:29:14,437 INFO L351 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 [2023-11-06 20:29:14,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:14,472 INFO L351 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 [2023-11-06 20:29:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:29:14,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:29:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336044079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:29:14,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:29:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-11-06 20:29:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541837078] [2023-11-06 20:29:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:29:14,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:29:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:29:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:29:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-11-06 20:29:14,502 INFO L87 Difference]: Start difference. First operand 66 states and 73 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) [2023-11-06 20:29:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:29:14,629 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-11-06 20:29:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:29:14,629 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 [2023-11-06 20:29:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:29:14,630 INFO L225 Difference]: With dead ends: 63 [2023-11-06 20:29:14,630 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 20:29:14,631 INFO L412 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 [2023-11-06 20:29:14,632 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:29:14,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 130 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2023-11-06 20:29:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 20:29:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 20:29:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 58 states have internal predecessors, (64), 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) [2023-11-06 20:29:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-11-06 20:29:14,637 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 28 [2023-11-06 20:29:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:29:14,638 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-11-06 20:29:14,638 INFO L496 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) [2023-11-06 20:29:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-11-06 20:29:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 20:29:14,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:29:14,640 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:29:14,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:29:14,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:14,846 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-06 20:29:14,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:29:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash -478938770, now seen corresponding path program 1 times [2023-11-06 20:29:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:29:14,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471540371] [2023-11-06 20:29:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:29:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:29:15,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:29:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471540371] [2023-11-06 20:29:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471540371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133833160] [2023-11-06 20:29:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:29:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:29:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:29:15,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:29:15,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b115172c-e5ac-47ef-94d2-a69903e03e8a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:29:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:29:16,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-06 20:29:16,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:29:16,119 INFO L351 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 [2023-11-06 20:29:16,477 INFO L351 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 19 treesize of output 11 [2023-11-06 20:29:16,482 INFO L351 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 7 treesize of output 3 [2023-11-06 20:29:16,713 WARN L861 $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|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 20:29:16,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:16,732 INFO L351 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 18 treesize of output 13 [2023-11-06 20:29:16,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:16,741 INFO L351 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 27 treesize of output 20 [2023-11-06 20:29:16,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:29:16,753 INFO L351 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 16 treesize of output 11 [2023-11-06 20:29:16,771 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 20:29:16,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 20:29:16,852 INFO L351 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 17 treesize of output 9 [2023-11-06 20:29:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-06 20:29:16,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:29:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133833160] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:29:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1646148943] [2023-11-06 20:29:17,296 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-06 20:29:17,296 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:29:17,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:29:17,297 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:29:17,297 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:29:18,988 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 123 for LOIs [2023-11-06 20:29:19,546 INFO L180 IcfgInterpreter]: Interpretation finished