./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:26:32,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:26:32,204 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 11:26:32,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:26:32,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:26:32,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:26:32,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:26:32,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:26:32,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:26:32,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:26:32,260 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:26:32,261 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:26:32,261 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:26:32,261 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:26:32,263 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:26:32,264 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:26:32,264 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:26:32,265 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:26:32,265 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:26:32,266 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:26:32,266 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:26:32,270 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:26:32,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 11:26:32,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 11:26:32,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:26:32,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:26:32,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:26:32,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:26:32,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:26:32,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 11:26:32,277 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 11:26:32,277 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 11:26:32,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:26:32,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 11:26:32,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:26:32,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:26:32,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:26:32,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:26:32,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:26:32,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:26:32,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:26:32,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:26:32,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:26:32,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:26:32,283 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:26:32,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:26:32,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:26:32,284 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:26:32,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:26:32,284 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_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2024-11-02 11:26:32,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:26:32,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:26:32,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:26:32,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:26:32,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:26:32,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i Unable to find full path for "g++" [2024-11-02 11:26:35,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:26:35,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:26:35,549 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-02 11:26:35,568 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/data/f7119b7c5/7b1e8f708ca248fa8c6deb62df2ad5bd/FLAG9d3b0ea44 [2024-11-02 11:26:35,775 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/data/f7119b7c5/7b1e8f708ca248fa8c6deb62df2ad5bd [2024-11-02 11:26:35,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:26:35,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:26:35,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:26:35,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:26:35,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:26:35,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:26:35" (1/1) ... [2024-11-02 11:26:35,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d601e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:35, skipping insertion in model container [2024-11-02 11:26:35,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:26:35" (1/1) ... [2024-11-02 11:26:35,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:26:36,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:26:36,214 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:26:36,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:26:36,328 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:26:36,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36 WrapperNode [2024-11-02 11:26:36,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:26:36,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:26:36,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:26:36,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:26:36,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,374 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-11-02 11:26:36,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:26:36,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:26:36,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:26:36,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:26:36,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:26:36,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:26:36,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:26:36,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:26:36,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (1/1) ... [2024-11-02 11:26:36,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:26:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:36,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:26:36,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:26:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 11:26:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-02 11:26:36,501 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-02 11:26:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 11:26:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:26:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 11:26:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 11:26:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 11:26:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 11:26:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-02 11:26:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:26:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:26:36,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:26:36,688 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:26:36,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:26:37,155 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-02 11:26:37,155 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:26:37,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:26:37,231 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-02 11:26:37,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:37 BoogieIcfgContainer [2024-11-02 11:26:37,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:26:37,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:26:37,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:26:37,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:26:37,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:26:35" (1/3) ... [2024-11-02 11:26:37,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633aee84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:26:37, skipping insertion in model container [2024-11-02 11:26:37,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:26:36" (2/3) ... [2024-11-02 11:26:37,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633aee84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:26:37, skipping insertion in model container [2024-11-02 11:26:37,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:26:37" (3/3) ... [2024-11-02 11:26:37,248 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2024-11-02 11:26:37,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:26:37,269 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-02 11:26:37,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:26:37,371 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75cd4b24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:26:37,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-02 11:26:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 39 states have (on average 2.282051282051282) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-02 11:26:37,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:37,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-02 11:26:37,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 181978514, now seen corresponding path program 1 times [2024-11-02 11:26:37,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:37,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947275866] [2024-11-02 11:26:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:37,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947275866] [2024-11-02 11:26:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947275866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:26:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458332272] [2024-11-02 11:26:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:37,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:37,887 INFO L87 Difference]: Start difference. First operand has 85 states, 39 states have (on average 2.282051282051282) internal successors, (89), 81 states have internal predecessors, (89), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:26:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:38,166 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-02 11:26:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-02 11:26:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:38,178 INFO L225 Difference]: With dead ends: 82 [2024-11-02 11:26:38,178 INFO L226 Difference]: Without dead ends: 80 [2024-11-02 11:26:38,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:38,184 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:38,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:26:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-02 11:26:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-02 11:26:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-02 11:26:38,241 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 5 [2024-11-02 11:26:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-02 11:26:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:26:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-02 11:26:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-02 11:26:38,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:38,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-02 11:26:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:26:38,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:38,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash 181978515, now seen corresponding path program 1 times [2024-11-02 11:26:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:38,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081801695] [2024-11-02 11:26:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:38,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:38,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081801695] [2024-11-02 11:26:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081801695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:38,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:26:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043157531] [2024-11-02 11:26:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:38,478 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:26:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:38,642 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-02 11:26:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-02 11:26:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:38,644 INFO L225 Difference]: With dead ends: 78 [2024-11-02 11:26:38,644 INFO L226 Difference]: Without dead ends: 78 [2024-11-02 11:26:38,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:38,649 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:38,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-02 11:26:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-02 11:26:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 37 states have (on average 2.108108108108108) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-02 11:26:38,666 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 5 [2024-11-02 11:26:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:38,666 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-02 11:26:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:26:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-02 11:26:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 11:26:38,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:38,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:38,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:26:38,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 666899088, now seen corresponding path program 1 times [2024-11-02 11:26:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399184144] [2024-11-02 11:26:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:38,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399184144] [2024-11-02 11:26:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399184144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:26:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436890228] [2024-11-02 11:26:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:38,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:26:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:26:38,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:38,782 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 11:26:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:38,849 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-02 11:26:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:26:38,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-02 11:26:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:38,851 INFO L225 Difference]: With dead ends: 79 [2024-11-02 11:26:38,851 INFO L226 Difference]: Without dead ends: 79 [2024-11-02 11:26:38,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:26:38,860 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:38,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 134 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:26:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-02 11:26:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-02 11:26:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 75 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) [2024-11-02 11:26:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-02 11:26:38,881 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 10 [2024-11-02 11:26:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:38,882 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-02 11:26:38,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 11:26:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-02 11:26:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 11:26:38,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:38,890 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:38,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:26:38,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:38,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash 686289329, now seen corresponding path program 1 times [2024-11-02 11:26:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:38,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467348957] [2024-11-02 11:26:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 11:26:39,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467348957] [2024-11-02 11:26:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467348957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:39,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:26:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742184490] [2024-11-02 11:26:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:26:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:26:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:26:39,184 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:26:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:39,408 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-02 11:26:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:26:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-02 11:26:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:39,410 INFO L225 Difference]: With dead ends: 78 [2024-11-02 11:26:39,410 INFO L226 Difference]: Without dead ends: 78 [2024-11-02 11:26:39,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:26:39,412 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:39,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:26:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-02 11:26:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-02 11:26:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-02 11:26:39,419 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 17 [2024-11-02 11:26:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:39,419 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-02 11:26:39,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:26:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-02 11:26:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 11:26:39,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:39,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:26:39,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:39,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash 686289330, now seen corresponding path program 1 times [2024-11-02 11:26:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288082116] [2024-11-02 11:26:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:26:39,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288082116] [2024-11-02 11:26:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288082116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:26:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:26:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:26:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38241061] [2024-11-02 11:26:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:26:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:26:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:26:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:26:39,773 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:26:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:39,975 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-11-02 11:26:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:26:39,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-02 11:26:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:39,977 INFO L225 Difference]: With dead ends: 77 [2024-11-02 11:26:39,977 INFO L226 Difference]: Without dead ends: 77 [2024-11-02 11:26:39,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:26:39,978 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:39,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:26:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-02 11:26:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-02 11:26:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 38 states have (on average 2.026315789473684) internal successors, (77), 73 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-02 11:26:39,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 17 [2024-11-02 11:26:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:39,991 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-02 11:26:39,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:26:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-02 11:26:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-02 11:26:39,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:39,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:39,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:26:39,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:39,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1900770924, now seen corresponding path program 1 times [2024-11-02 11:26:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:39,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885104781] [2024-11-02 11:26:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:26:40,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885104781] [2024-11-02 11:26:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885104781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107092945] [2024-11-02 11:26:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:40,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:26:40,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:40,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:26:40,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 11:26:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:40,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-02 11:26:40,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:26:40,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 11:26:40,634 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-02 11:26:40,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-02 11:26:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:26:40,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:26:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:26:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107092945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:26:41,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1385902451] [2024-11-02 11:26:41,113 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-02 11:26:41,113 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:26:41,118 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:26:41,123 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:26:41,123 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:26:42,456 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-02 11:26:42,584 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 11:26:48,557 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (not (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2024-11-02 11:26:48,557 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 11:26:48,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:26:48,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-02 11:26:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625356353] [2024-11-02 11:26:48,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:26:48,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-02 11:26:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:48,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-02 11:26:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=748, Unknown=2, NotChecked=0, Total=870 [2024-11-02 11:26:48,565 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-02 11:26:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:49,393 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-02 11:26:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 11:26:49,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-11-02 11:26:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:49,396 INFO L225 Difference]: With dead ends: 76 [2024-11-02 11:26:49,396 INFO L226 Difference]: Without dead ends: 76 [2024-11-02 11:26:49,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=129, Invalid=799, Unknown=2, NotChecked=0, Total=930 [2024-11-02 11:26:49,400 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:49,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 464 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-02 11:26:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-02 11:26:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-02 11:26:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.0) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-02 11:26:49,412 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2024-11-02 11:26:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-02 11:26:49,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-02 11:26:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-02 11:26:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-02 11:26:49,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:49,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:49,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 11:26:49,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-02 11:26:49,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1900770923, now seen corresponding path program 1 times [2024-11-02 11:26:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79156935] [2024-11-02 11:26:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:26:50,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79156935] [2024-11-02 11:26:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79156935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959971286] [2024-11-02 11:26:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:50,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:26:50,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:50,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:26:50,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 11:26:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:50,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-02 11:26:50,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:26:50,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-02 11:26:50,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 11:26:50,461 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-02 11:26:50,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-02 11:26:50,486 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-02 11:26:50,486 INFO L378 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 11 treesize of output 11 [2024-11-02 11:26:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:50,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:26:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959971286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2101981139] [2024-11-02 11:26:50,767 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-02 11:26:50,769 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:26:50,770 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:26:50,770 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:26:50,770 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:26:51,518 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-02 11:26:51,633 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 11:26:53,505 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1276#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (<= (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 3)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2024-11-02 11:26:53,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 11:26:53,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 11:26:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-02 11:26:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647029096] [2024-11-02 11:26:53,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 11:26:53,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-02 11:26:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-02 11:26:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2024-11-02 11:26:53,508 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-02 11:26:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:54,210 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-11-02 11:26:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 11:26:54,211 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2024-11-02 11:26:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:54,212 INFO L225 Difference]: With dead ends: 77 [2024-11-02 11:26:54,212 INFO L226 Difference]: Without dead ends: 77 [2024-11-02 11:26:54,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=1197, Unknown=0, NotChecked=0, Total=1332 [2024-11-02 11:26:54,214 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:54,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 11:26:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-02 11:26:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-02 11:26:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:26:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-02 11:26:54,227 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 19 [2024-11-02 11:26:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:54,227 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-02 11:26:54,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-02 11:26:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-02 11:26:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 11:26:54,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:54,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:54,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-02 11:26:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:26:54,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1279626243, now seen corresponding path program 1 times [2024-11-02 11:26:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487590125] [2024-11-02 11:26:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-02 11:26:54,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487590125] [2024-11-02 11:26:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487590125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253846773] [2024-11-02 11:26:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:26:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:54,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:26:54,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 11:26:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:54,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-02 11:26:54,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:26:54,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 11:26:54,937 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-02 11:26:54,968 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-02 11:26:54,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-02 11:26:55,017 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-02 11:26:55,020 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-02 11:26:55,038 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-02 11:26:55,041 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-02 11:26:55,063 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))) is different from false [2024-11-02 11:26:55,066 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))) is different from true [2024-11-02 11:26:55,111 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))) is different from false [2024-11-02 11:26:55,114 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))) is different from true [2024-11-02 11:26:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-02 11:26:55,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:26:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253846773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1216925642] [2024-11-02 11:26:55,411 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-02 11:26:55,412 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:26:55,412 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:26:55,413 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:26:55,413 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:26:56,112 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-02 11:26:56,209 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 11:26:57,830 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1577#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= |#memory_int| (store |v_#memory_int_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-02 11:26:57,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 11:26:57,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 11:26:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-02 11:26:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415156585] [2024-11-02 11:26:57,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 11:26:57,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-02 11:26:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:26:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-02 11:26:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=808, Unknown=9, NotChecked=310, Total=1260 [2024-11-02 11:26:57,833 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 16 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-02 11:26:57,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2024-11-02 11:26:57,970 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2024-11-02 11:26:57,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse1 (select |c_#valid| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-02 11:26:57,976 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| .cse1 (select |c_#valid| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-02 11:26:57,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2024-11-02 11:26:57,981 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2024-11-02 11:26:57,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))))) is different from false [2024-11-02 11:26:57,986 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))))) is different from true [2024-11-02 11:26:57,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))))) is different from false [2024-11-02 11:26:57,992 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_45| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_45| (@diff |v_#valid_BEFORE_CALL_45| |c_#valid|) 1)))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_26|) 1)))))) is different from true [2024-11-02 11:26:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:26:58,458 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2024-11-02 11:26:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-02 11:26:58,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-02 11:26:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:26:58,460 INFO L225 Difference]: With dead ends: 122 [2024-11-02 11:26:58,460 INFO L226 Difference]: Without dead ends: 122 [2024-11-02 11:26:58,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=170, Invalid=973, Unknown=19, NotChecked=730, Total=1892 [2024-11-02 11:26:58,462 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 75 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:26:58,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 270 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 485 Invalid, 0 Unknown, 749 Unchecked, 0.5s Time] [2024-11-02 11:26:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-02 11:26:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 83. [2024-11-02 11:26:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 78 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 11:26:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2024-11-02 11:26:58,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 21 [2024-11-02 11:26:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:26:58,468 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2024-11-02 11:26:58,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-02 11:26:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2024-11-02 11:26:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 11:26:58,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:26:58,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:26:58,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-02 11:26:58,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:26:58,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:26:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:26:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1279626242, now seen corresponding path program 1 times [2024-11-02 11:26:58,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:26:58,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68639892] [2024-11-02 11:26:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:26:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:26:59,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:26:59,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68639892] [2024-11-02 11:26:59,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68639892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:59,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782092744] [2024-11-02 11:26:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:26:59,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:26:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:26:59,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:26:59,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-02 11:26:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:26:59,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-02 11:26:59,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:26:59,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-02 11:26:59,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 11:26:59,404 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-02 11:26:59,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:26:59,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 11:26:59,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-02 11:26:59,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 11:26:59,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-02 11:26:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 11:26:59,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:26:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782092744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:26:59,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [336467626] [2024-11-02 11:26:59,710 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-02 11:26:59,711 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:26:59,711 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:26:59,711 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:26:59,711 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:27:00,430 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-02 11:27:00,520 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 11:27:02,487 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1909#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (store |v_#memory_int_103| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_103| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0))) |#memory_int|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0))))) (<= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 3) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-02 11:27:02,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 11:27:02,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 11:27:02,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2024-11-02 11:27:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459527798] [2024-11-02 11:27:02,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 11:27:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-02 11:27:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-02 11:27:02,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=711, Unknown=1, NotChecked=54, Total=870 [2024-11-02 11:27:02,491 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-02 11:27:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:02,991 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-11-02 11:27:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:27:02,991 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-02 11:27:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:02,992 INFO L225 Difference]: With dead ends: 74 [2024-11-02 11:27:02,992 INFO L226 Difference]: Without dead ends: 74 [2024-11-02 11:27:02,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=864, Unknown=1, NotChecked=60, Total=1056 [2024-11-02 11:27:02,994 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:02,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 134 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 275 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2024-11-02 11:27:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-02 11:27:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-02 11:27:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 11:27:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-11-02 11:27:03,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 21 [2024-11-02 11:27:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:03,002 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-11-02 11:27:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-02 11:27:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-11-02 11:27:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 11:27:03,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:03,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:03,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-02 11:27:03,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1b6e5b-0fb0-4d6a-b050-ea7f0b861460/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:27:03,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:27:03,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1279622108, now seen corresponding path program 1 times [2024-11-02 11:27:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613599166] [2024-11-02 11:27:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 11:27:03,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613599166] [2024-11-02 11:27:03,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613599166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:03,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:03,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:27:03,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679349964] [2024-11-02 11:27:03,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:03,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:27:03,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:03,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:27:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:27:03,297 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:03,347 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-02 11:27:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:27:03,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-02 11:27:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:03,348 INFO L225 Difference]: With dead ends: 109 [2024-11-02 11:27:03,348 INFO L226 Difference]: Without dead ends: 109 [2024-11-02 11:27:03,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:27:03,350 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 122 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:03,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 101 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 11:27:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-02 11:27:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2024-11-02 11:27:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.5625) internal successors, (75), 68 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 11:27:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-11-02 11:27:03,355 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 21 [2024-11-02 11:27:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:03,356 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-11-02 11:27:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-02 11:27:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-02 11:27:03,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:03,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 11:27:03,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:27:03,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1013707858, now seen corresponding path program 1 times [2024-11-02 11:27:03,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54684162] [2024-11-02 11:27:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 11:27:03,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54684162] [2024-11-02 11:27:03,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54684162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:03,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:03,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-02 11:27:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837567830] [2024-11-02 11:27:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:03,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-02 11:27:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-02 11:27:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-02 11:27:03,606 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:03,940 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-02 11:27:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:27:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-02 11:27:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:03,946 INFO L225 Difference]: With dead ends: 96 [2024-11-02 11:27:03,946 INFO L226 Difference]: Without dead ends: 96 [2024-11-02 11:27:03,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-02 11:27:03,947 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:03,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 222 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:27:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-02 11:27:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2024-11-02 11:27:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 11:27:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-11-02 11:27:03,955 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2024-11-02 11:27:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:03,955 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-11-02 11:27:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-11-02 11:27:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-02 11:27:03,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:03,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 11:27:03,957 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:27:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1013707857, now seen corresponding path program 1 times [2024-11-02 11:27:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870581274] [2024-11-02 11:27:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:27:04,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870581274] [2024-11-02 11:27:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870581274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-02 11:27:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104659003] [2024-11-02 11:27:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-02 11:27:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-02 11:27:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-02 11:27:04,331 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:04,717 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-02 11:27:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:27:04,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-02 11:27:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:04,719 INFO L225 Difference]: With dead ends: 97 [2024-11-02 11:27:04,719 INFO L226 Difference]: Without dead ends: 97 [2024-11-02 11:27:04,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-02 11:27:04,720 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:04,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 297 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:27:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-02 11:27:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2024-11-02 11:27:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.510204081632653) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 11:27:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-02 11:27:04,724 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 22 [2024-11-02 11:27:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:04,725 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-02 11:27:04,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-02 11:27:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-02 11:27:04,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:04,726 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:04,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 11:27:04,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:27:04,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1360168698, now seen corresponding path program 1 times [2024-11-02 11:27:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436345593] [2024-11-02 11:27:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:04,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 11:27:04,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436345593] [2024-11-02 11:27:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436345593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:27:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376998286] [2024-11-02 11:27:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:27:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:27:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:27:04,778 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:04,845 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-02 11:27:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:27:04,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-02 11:27:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:04,846 INFO L225 Difference]: With dead ends: 73 [2024-11-02 11:27:04,847 INFO L226 Difference]: Without dead ends: 73 [2024-11-02 11:27:04,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:27:04,847 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:04,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:27:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-02 11:27:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2024-11-02 11:27:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:27:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-02 11:27:04,851 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 23 [2024-11-02 11:27:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-02 11:27:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-02 11:27:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-02 11:27:04,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:04,852 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 11:27:04,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:27:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2064174907, now seen corresponding path program 1 times [2024-11-02 11:27:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857404322] [2024-11-02 11:27:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 11:27:04,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857404322] [2024-11-02 11:27:04,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857404322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:04,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:27:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762333611] [2024-11-02 11:27:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:04,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:27:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:04,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:27:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:27:04,945 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:27:05,121 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-11-02 11:27:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:27:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-02 11:27:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:27:05,123 INFO L225 Difference]: With dead ends: 63 [2024-11-02 11:27:05,123 INFO L226 Difference]: Without dead ends: 63 [2024-11-02 11:27:05,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:27:05,124 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:27:05,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:27:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-02 11:27:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-02 11:27:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 11:27:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2024-11-02 11:27:05,128 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 26 [2024-11-02 11:27:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:27:05,128 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-11-02 11:27:05,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 11:27:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2024-11-02 11:27:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-02 11:27:05,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:27:05,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:27:05,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 11:27:05,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-02 11:27:05,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:27:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2064174906, now seen corresponding path program 1 times [2024-11-02 11:27:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:27:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84429714] [2024-11-02 11:27:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:27:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:27:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:27:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 11:27:05,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:27:05,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84429714] [2024-11-02 11:27:05,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84429714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:27:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:27:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-02 11:27:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813035575] [2024-11-02 11:27:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:27:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-02 11:27:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:27:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-02 11:27:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-02 11:27:05,609 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)