./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E --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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:30:44,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:30:45,063 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:30:45,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:30:45,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:30:45,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:30:45,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:30:45,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:30:45,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:30:45,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:30:45,124 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:30:45,125 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:30:45,125 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:30:45,125 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:30:45,125 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:30:45,126 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:30:45,126 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:30:45,126 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:30:45,126 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:30:45,127 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:30:45,127 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:30:45,127 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:30:45,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:30:45,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:30:45,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:30:45,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:30:45,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:30:45,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:30:45,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:30:45,130 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:30:45,130 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:30:45,130 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:30:45,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:30:45,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:30:45,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:30:45,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:30:45,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:30:45,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:30:45,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:30:45,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:30:45,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:30:45,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:30:45,133 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2024-11-14 05:30:45,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:30:45,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:30:45,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:30:45,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:30:45,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:30:45,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i Unable to find full path for "g++" [2024-11-14 05:30:47,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:30:48,184 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:30:48,185 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-14 05:30:48,200 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/data/ba58a9b2c/b09b1ab58e4548b19cb705216c36f92f/FLAG748bc1847 [2024-11-14 05:30:48,217 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/data/ba58a9b2c/b09b1ab58e4548b19cb705216c36f92f [2024-11-14 05:30:48,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:30:48,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:30:48,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:30:48,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:30:48,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:30:48,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1687b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48, skipping insertion in model container [2024-11-14 05:30:48,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:30:48,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:30:48,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:30:48,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:30:48,757 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:30:48,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48 WrapperNode [2024-11-14 05:30:48,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:30:48,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:30:48,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:30:48,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:30:48,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,838 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 138 [2024-11-14 05:30:48,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:30:48,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:30:48,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:30:48,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:30:48,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:30:48,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:30:48,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:30:48,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:30:48,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (1/1) ... [2024-11-14 05:30:48,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:30:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:48,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:30:48,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:30:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:30:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:30:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:30:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:30:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:30:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:30:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:30:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:30:49,168 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:30:49,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:30:49,792 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-14 05:30:49,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:30:49,915 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:30:49,919 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 05:30:49,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:49 BoogieIcfgContainer [2024-11-14 05:30:49,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:30:49,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:30:49,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:30:49,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:30:49,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:30:48" (1/3) ... [2024-11-14 05:30:49,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e252830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:49, skipping insertion in model container [2024-11-14 05:30:49,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:48" (2/3) ... [2024-11-14 05:30:49,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e252830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:49, skipping insertion in model container [2024-11-14 05:30:49,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:49" (3/3) ... [2024-11-14 05:30:49,939 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2024-11-14 05:30:49,960 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:30:49,963 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_unequal.i that has 2 procedures, 84 locations, 1 initial locations, 4 loop locations, and 39 error locations. [2024-11-14 05:30:50,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:30:50,058 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;@7c9b0ffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:30:50,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-14 05:30:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 2.268292682926829) internal successors, (93), 80 states have internal predecessors, (93), 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-14 05:30:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:30:50,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:50,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:30:50,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:30:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1987604253, now seen corresponding path program 1 times [2024-11-14 05:30:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529727668] [2024-11-14 05:30:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:50,341 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-14 05:30:50,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529727668] [2024-11-14 05:30:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529727668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:30:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104057218] [2024-11-14 05:30:50,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:50,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:50,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:50,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:50,392 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 2.268292682926829) internal successors, (93), 80 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:50,490 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-11-14 05:30:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:30:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:50,503 INFO L225 Difference]: With dead ends: 89 [2024-11-14 05:30:50,504 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 05:30:50,508 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-14 05:30:50,514 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:50,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 05:30:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-14 05:30:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 40 states have (on average 2.15) internal successors, (86), 78 states have internal predecessors, (86), 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-14 05:30:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-14 05:30:50,586 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 6 [2024-11-14 05:30:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:50,587 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-14 05:30:50,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-14 05:30:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:30:50,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:50,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:30:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:30:50,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:30:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1817616807, now seen corresponding path program 1 times [2024-11-14 05:30:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469541284] [2024-11-14 05:30:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:50,796 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-14 05:30:50,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469541284] [2024-11-14 05:30:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469541284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:30:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921067801] [2024-11-14 05:30:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:50,801 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:50,934 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-11-14 05:30:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:30:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:50,936 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:30:50,936 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:30:50,937 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-14 05:30:50,938 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:50,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:30:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 05:30:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.1) internal successors, (84), 76 states have internal predecessors, (84), 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-14 05:30:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-11-14 05:30:50,947 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 6 [2024-11-14 05:30:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:50,948 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-11-14 05:30:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-11-14 05:30:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:30:50,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:50,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:30:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:30:50,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:30:50,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1817616808, now seen corresponding path program 1 times [2024-11-14 05:30:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523000566] [2024-11-14 05:30:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:51,101 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-14 05:30:51,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523000566] [2024-11-14 05:30:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523000566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:30:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2672550] [2024-11-14 05:30:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:51,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:30:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:30:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:30:51,104 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:51,239 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-11-14 05:30:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:30:51,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:30:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:51,242 INFO L225 Difference]: With dead ends: 78 [2024-11-14 05:30:51,242 INFO L226 Difference]: Without dead ends: 78 [2024-11-14 05:30:51,242 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-14 05:30:51,243 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 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-14 05:30:51,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:30:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-14 05:30:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-14 05:30:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 2.05) internal successors, (82), 74 states have internal predecessors, (82), 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-14 05:30:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-11-14 05:30:51,264 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 6 [2024-11-14 05:30:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:51,264 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-11-14 05:30:51,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:30:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-11-14 05:30:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:30:51,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:51,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:51,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:30:51,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:30:51,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash 932859801, now seen corresponding path program 1 times [2024-11-14 05:30:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040892114] [2024-11-14 05:30:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:51,506 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-14 05:30:51,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040892114] [2024-11-14 05:30:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040892114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:30:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030881619] [2024-11-14 05:30:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:51,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:30:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:30:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:30:51,511 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:30:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:51,805 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-14 05:30:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:30:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:30:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:51,807 INFO L225 Difference]: With dead ends: 77 [2024-11-14 05:30:51,807 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 05:30:51,807 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-14 05:30:51,808 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:51,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:30:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 05:30:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-14 05:30:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 2.025) internal successors, (81), 73 states have internal predecessors, (81), 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-14 05:30:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-11-14 05:30:51,826 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 10 [2024-11-14 05:30:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-11-14 05:30:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:30:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-11-14 05:30:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:30:51,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:51,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:51,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:30:51,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:30:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 932859802, now seen corresponding path program 1 times [2024-11-14 05:30:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018691274] [2024-11-14 05:30:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:52,164 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-14 05:30:52,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:52,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018691274] [2024-11-14 05:30:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018691274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:52,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:52,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:30:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122956486] [2024-11-14 05:30:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:52,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:30:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:30:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:52,168 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:30:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:52,429 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-11-14 05:30:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:30:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:30:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:52,432 INFO L225 Difference]: With dead ends: 76 [2024-11-14 05:30:52,432 INFO L226 Difference]: Without dead ends: 76 [2024-11-14 05:30:52,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:52,433 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:52,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:30:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-14 05:30:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-14 05:30:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 2.0) internal successors, (80), 72 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-14 05:30:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-14 05:30:52,447 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 10 [2024-11-14 05:30:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-14 05:30:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:30:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-14 05:30:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:30:52,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:52,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:30:52,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:30:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash -667121247, now seen corresponding path program 1 times [2024-11-14 05:30:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301793018] [2024-11-14 05:30:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:52,621 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-14 05:30:52,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301793018] [2024-11-14 05:30:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301793018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:30:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793261833] [2024-11-14 05:30:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:52,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:52,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:52,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:52,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:30:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:52,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:30:52,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:30:52,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:30:52,959 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-14 05:30:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793261833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:30:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531703108] [2024-11-14 05:30:52,989 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 05:30:52,989 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:30:52,994 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:30:53,000 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:30:53,000 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:30:55,468 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2024-11-14 05:30:56,109 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:31:05,042 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1014#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_22| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_22|) 1)) (or (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_44|) (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_69| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_17| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_sll_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (select |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_44|) (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_9| (Array Int Int)) (|v_#memory_$Pointer$.base_69| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_69| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_69| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_int)_AFTER_CALL_9|) (<= 8 (select |v_old(#length)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |v_ULTIMATE.start_sll_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (select |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_90| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_65| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))))))' at error location [2024-11-14 05:31:05,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:31:05,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:31:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-14 05:31:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062682574] [2024-11-14 05:31:05,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:05,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:31:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:31:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=207, Unknown=1, NotChecked=0, Total=240 [2024-11-14 05:31:05,045 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:31:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:05,116 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-14 05:31:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:31:05,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-14 05:31:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:05,118 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:31:05,118 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:31:05,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=32, Invalid=207, Unknown=1, NotChecked=0, Total=240 [2024-11-14 05:31:05,119 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:05,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 207 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:31:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:31:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 05:31:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.930232558139535) internal successors, (83), 75 states have internal predecessors, (83), 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-14 05:31:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-14 05:31:05,136 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 19 [2024-11-14 05:31:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:05,136 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-14 05:31:05,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:31:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-14 05:31:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:31:05,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:05,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:05,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 05:31:05,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:05,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:05,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1408508655, now seen corresponding path program 2 times [2024-11-14 05:31:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144721138] [2024-11-14 05:31:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:31:06,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144721138] [2024-11-14 05:31:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144721138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607638753] [2024-11-14 05:31:06,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:31:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:06,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:06,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:06,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:31:06,260 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:31:06,260 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:31:06,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:31:06,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:06,296 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-14 05:31:06,328 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-14 05:31:06,349 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 05:31:06,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:06,389 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-14 05:31:06,422 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-14 05:31:06,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:06,476 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-14 05:31:06,520 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-14 05:31:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:06,566 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-14 05:31:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:31:06,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607638753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-14 05:31:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175261210] [2024-11-14 05:31:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:31:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:31:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-14 05:31:06,575 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:06,783 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-11-14 05:31:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:31:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-14 05:31:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:06,784 INFO L225 Difference]: With dead ends: 77 [2024-11-14 05:31:06,784 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 05:31:06,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2024-11-14 05:31:06,786 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:06,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2024-11-14 05:31:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 05:31:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-14 05:31:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 72 states have internal predecessors, (80), 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-14 05:31:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-11-14 05:31:06,798 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 28 [2024-11-14 05:31:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:06,798 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-11-14 05:31:06,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-11-14 05:31:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:31:06,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:06,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:06,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:31:06,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 05:31:07,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:07,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1408508654, now seen corresponding path program 1 times [2024-11-14 05:31:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:07,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525962761] [2024-11-14 05:31:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:31:08,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525962761] [2024-11-14 05:31:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525962761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491354738] [2024-11-14 05:31:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:08,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:08,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:08,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:08,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:31:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:08,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:31:08,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:08,243 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-14 05:31:08,295 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-14 05:31:08,306 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-14 05:31:08,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:08,339 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-14 05:31:08,382 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-14 05:31:08,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:08,425 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-14 05:31:08,505 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-14 05:31:08,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:08,566 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-14 05:31:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:31:08,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491354738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-14 05:31:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037704806] [2024-11-14 05:31:08,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:31:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:31:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-11-14 05:31:08,605 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:08,796 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-11-14 05:31:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:31:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-14 05:31:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:08,798 INFO L225 Difference]: With dead ends: 74 [2024-11-14 05:31:08,798 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 05:31:08,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-11-14 05:31:08,799 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:08,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 172 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2024-11-14 05:31:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 05:31:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-14 05:31:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 69 states have internal predecessors, (77), 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-14 05:31:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-14 05:31:08,805 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 28 [2024-11-14 05:31:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:08,805 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-14 05:31:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-14 05:31:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:31:08,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:08,811 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:08,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:31:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 05:31:09,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 949150500, now seen corresponding path program 1 times [2024-11-14 05:31:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821476360] [2024-11-14 05:31:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:31:09,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821476360] [2024-11-14 05:31:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821476360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61424810] [2024-11-14 05:31:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:09,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:09,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:09,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:09,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:31:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:10,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 05:31:10,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:10,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-14 05:31:10,608 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_28| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_28| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_28|))) (<= (+ |v_node_create_~temp~0#1.base_28| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_28| 1)))) is different from true [2024-11-14 05:31:10,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:31:10,647 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 05:31:10,648 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 16 treesize of output 18 [2024-11-14 05:31:10,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:31:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:31:10,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:10,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61424810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:10,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:10,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2024-11-14 05:31:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646739497] [2024-11-14 05:31:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:10,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:31:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:31:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-11-14 05:31:10,793 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:11,209 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-14 05:31:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:31:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-14 05:31:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:11,211 INFO L225 Difference]: With dead ends: 73 [2024-11-14 05:31:11,211 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 05:31:11,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=359, Unknown=1, NotChecked=38, Total=462 [2024-11-14 05:31:11,212 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:11,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2024-11-14 05:31:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 05:31:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-14 05:31:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.75) internal successors, (77), 68 states have internal predecessors, (77), 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-14 05:31:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-14 05:31:11,218 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 31 [2024-11-14 05:31:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:11,218 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-14 05:31:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-14 05:31:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:31:11,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:11,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:11,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:31:11,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 05:31:11,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash 949150501, now seen corresponding path program 1 times [2024-11-14 05:31:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897874041] [2024-11-14 05:31:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:31:12,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897874041] [2024-11-14 05:31:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897874041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100001081] [2024-11-14 05:31:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:12,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:12,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:12,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:31:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:13,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-14 05:31:13,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:13,193 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-14 05:31:13,396 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-14 05:31:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:31:13,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:13,861 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_31| Int)) (and (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_31| (select |c_#length| |v_node_create_~temp~0#1.base_31|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_31|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_31| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_31|)) |c_#memory_$Pointer$.offset|) (<= (+ |v_node_create_~temp~0#1.base_31| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 05:31:13,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:13,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:31:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:13,906 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 18 treesize of output 13 [2024-11-14 05:31:13,923 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:31:13,923 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 15 treesize of output 15 [2024-11-14 05:31:13,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:13,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:31:14,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:31:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-14 05:31:14,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:14,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100001081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:14,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [605677979] [2024-11-14 05:31:14,508 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:31:14,508 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:14,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:31:14,509 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:31:14,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:31:15,696 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 117 for LOIs [2024-11-14 05:31:16,122 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:31:23,482 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2085#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_25| Int)) (and (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0) 0))) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_30| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_30| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#valid_104| (Array Int Int))) (and (= |#valid| (store |v_#valid_104| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_104| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_91| (Array Int Int))) (= |#length| (store |v_#length_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_25| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#valid_104| (Array Int Int))) (and (= |#valid| (store |v_#valid_104| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_104| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_91| (Array Int Int))) (= |#length| (store |v_#length_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_25| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_35| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_81| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 1) (or (< (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_25|)))) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:31:23,482 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:31:23,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:31:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2024-11-14 05:31:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270228039] [2024-11-14 05:31:23,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 05:31:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 05:31:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2012, Unknown=1, NotChecked=90, Total=2256 [2024-11-14 05:31:23,486 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 30 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 26 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:31:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:25,156 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-11-14 05:31:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:31:25,156 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 26 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-11-14 05:31:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:25,157 INFO L225 Difference]: With dead ends: 76 [2024-11-14 05:31:25,157 INFO L226 Difference]: Without dead ends: 76 [2024-11-14 05:31:25,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=226, Invalid=2857, Unknown=1, NotChecked=108, Total=3192 [2024-11-14 05:31:25,160 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 121 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:25,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 646 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 802 Invalid, 0 Unknown, 82 Unchecked, 0.9s Time] [2024-11-14 05:31:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-14 05:31:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-14 05:31:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.702127659574468) internal successors, (80), 71 states have internal predecessors, (80), 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-14 05:31:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-11-14 05:31:25,169 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 31 [2024-11-14 05:31:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:25,169 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-11-14 05:31:25,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 26 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 05:31:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-11-14 05:31:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:31:25,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:25,173 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:25,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:31:25,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:31:25,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -641403789, now seen corresponding path program 1 times [2024-11-14 05:31:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386741720] [2024-11-14 05:31:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:31:25,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386741720] [2024-11-14 05:31:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386741720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:25,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:31:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571095864] [2024-11-14 05:31:25,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:31:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:31:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:31:25,506 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 6 states have internal predecessors, (15), 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-14 05:31:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:25,661 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-14 05:31:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:31:25,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-14 05:31:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:25,662 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:31:25,662 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:31:25,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:31:25,663 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 55 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:25,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 121 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:31:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:31:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2024-11-14 05:31:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.6595744680851063) 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-14 05:31:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-11-14 05:31:25,669 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 32 [2024-11-14 05:31:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:25,669 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-11-14 05:31:25,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 6 states have internal predecessors, (15), 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-14 05:31:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-11-14 05:31:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:31:25,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:25,671 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:25,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:31:25,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:25,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash -641403788, now seen corresponding path program 1 times [2024-11-14 05:31:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453068326] [2024-11-14 05:31:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:31:25,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:25,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453068326] [2024-11-14 05:31:25,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453068326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:25,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:31:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365826106] [2024-11-14 05:31:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:25,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:31:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:31:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:31:25,908 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 7 states have internal predecessors, (15), 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-14 05:31:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:26,037 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-11-14 05:31:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-14 05:31:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:26,039 INFO L225 Difference]: With dead ends: 72 [2024-11-14 05:31:26,039 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 05:31:26,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:26,040 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:26,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 107 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:31:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 05:31:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-14 05:31:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 67 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-14 05:31:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-11-14 05:31:26,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 32 [2024-11-14 05:31:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:26,044 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-11-14 05:31:26,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 7 states have internal predecessors, (15), 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-14 05:31:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-11-14 05:31:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:31:26,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:26,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:26,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:31:26,046 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1591322686, now seen corresponding path program 1 times [2024-11-14 05:31:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:26,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201250917] [2024-11-14 05:31:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 05:31:26,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201250917] [2024-11-14 05:31:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201250917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:31:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588136844] [2024-11-14 05:31:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:31:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:26,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:31:26,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:31:26,336 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:26,668 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2024-11-14 05:31:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:31:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 05:31:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:26,672 INFO L225 Difference]: With dead ends: 116 [2024-11-14 05:31:26,672 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 05:31:26,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:31:26,673 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:26,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 250 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:31:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 05:31:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2024-11-14 05:31:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 68 states have internal predecessors, (79), 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-14 05:31:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-11-14 05:31:26,681 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 33 [2024-11-14 05:31:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:26,682 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-11-14 05:31:26,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-11-14 05:31:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:31:26,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:26,685 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:26,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:31:26,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1591322687, now seen corresponding path program 1 times [2024-11-14 05:31:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728922352] [2024-11-14 05:31:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:31:27,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728922352] [2024-11-14 05:31:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728922352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:31:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329091460] [2024-11-14 05:31:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:27,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:31:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:31:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:31:27,160 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:27,467 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2024-11-14 05:31:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:31:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 05:31:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:27,469 INFO L225 Difference]: With dead ends: 115 [2024-11-14 05:31:27,469 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 05:31:27,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:31:27,470 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 61 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:27,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 261 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:31:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 05:31:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2024-11-14 05:31:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 74 states have internal predecessors, (86), 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-14 05:31:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2024-11-14 05:31:27,478 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 33 [2024-11-14 05:31:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:27,478 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2024-11-14 05:31:27,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:31:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2024-11-14 05:31:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:31:27,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:27,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:31:27,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1922107543, now seen corresponding path program 1 times [2024-11-14 05:31:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225707812] [2024-11-14 05:31:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:29,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225707812] [2024-11-14 05:31:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225707812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862047283] [2024-11-14 05:31:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:29,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:29,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:29,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:31:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:29,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-14 05:31:29,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:29,602 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-14 05:31:29,863 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:31:29,864 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-14 05:31:30,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-14 05:31:30,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:30,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2024-11-14 05:31:30,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:30,345 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_42| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_42| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_42|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_42| 1) |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_42|)) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_42| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_42|)) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_42| 1)))) is different from true [2024-11-14 05:31:30,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:30,380 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:31:30,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2024-11-14 05:31:30,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:31:30,442 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-14 05:31:30,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-14 05:31:30,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:31:30,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:30,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2024-11-14 05:31:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 05:31:31,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862047283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:31,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224787069] [2024-11-14 05:31:31,568 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:31:31,568 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:31,568 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:31:31,571 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:31:31,571 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:31:33,057 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 117 for LOIs [2024-11-14 05:31:33,426 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:31:41,450 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3163#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_38| Int)) (and (or (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_27| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_27|)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 1) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0)) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_41| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_41| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_98| (Array Int Int))) (= (store |v_#length_98| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_68|))) (= |v_ULTIMATE.start_sll_append_~head#1.base_27| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_116| (Array Int Int))) (and (= (select |v_#valid_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_116| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_100| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#length_98| (Array Int Int))) (= (store |v_#length_98| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_68|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |v_ULTIMATE.start_sll_append_~head#1.base_27| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_116| (Array Int Int))) (and (= (select |v_#valid_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_116| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_100| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0) |ULTIMATE.start_sll_append_~last~0#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0) 0))))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_37| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_33| Int)) (and (<= 0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_33| 4)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_33| 4)) |ULTIMATE.start_sll_append_~last~0#1.offset|) (<= (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_33| 8) (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|) 1) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_33| 4)))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_38|) 1)))) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:31:41,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:31:41,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:31:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2024-11-14 05:31:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132471816] [2024-11-14 05:31:41,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 05:31:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 05:31:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3211, Unknown=1, NotChecked=114, Total=3540 [2024-11-14 05:31:41,453 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 39 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:31:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:43,680 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2024-11-14 05:31:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:31:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-14 05:31:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:43,682 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:31:43,682 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:31:43,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=334, Invalid=4639, Unknown=1, NotChecked=138, Total=5112 [2024-11-14 05:31:43,684 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 147 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:43,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 867 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1162 Invalid, 0 Unknown, 90 Unchecked, 1.2s Time] [2024-11-14 05:31:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:31:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-14 05:31:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 75 states have internal predecessors, (88), 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-14 05:31:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-14 05:31:43,689 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 34 [2024-11-14 05:31:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:43,689 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-14 05:31:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:31:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-14 05:31:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 05:31:43,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:43,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:31:43,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:31:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 05:31:43,891 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:31:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1922107542, now seen corresponding path program 1 times [2024-11-14 05:31:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20226045] [2024-11-14 05:31:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:31:46,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20226045] [2024-11-14 05:31:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20226045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570025563] [2024-11-14 05:31:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:46,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:46,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:31:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:46,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-14 05:31:46,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:47,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-14 05:31:47,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:31:47,205 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:31:47,205 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-14 05:31:47,226 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-14 05:31:47,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:31:47,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:31:47,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:47,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2024-11-14 05:31:47,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:31:47,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-14 05:31:47,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:47,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:31:47,960 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_53| Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_53| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_53|))) (= |c_#length| (store |c_old(#length)| |v_node_create_~temp~0#1.base_53| (select |c_#length| |v_node_create_~temp~0#1.base_53|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_53|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_53| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_53|))) (<= (+ |v_node_create_~temp~0#1.base_53| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 05:31:47,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:48,000 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:31:48,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2024-11-14 05:31:48,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:48,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-14 05:31:48,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:48,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:48,028 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:31:48,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 05:31:48,049 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:31:48,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:31:48,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:48,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-11-14 05:31:48,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:48,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 05:31:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 05:31:48,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570025563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [229581985] [2024-11-14 05:31:48,944 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:31:48,944 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:48,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:31:48,945 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:31:48,945 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:31:49,999 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 117 for LOIs [2024-11-14 05:31:50,315 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:32:08,123 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3544#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_40| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_45| Int)) (and (or (< (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_45|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_40| 8)) (< (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_40| 4) 0)) (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_39| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_44| Int)) (and (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_39| 4)) |v_ULTIMATE.start_sll_append_~last~0#1.offset_40|) (<= (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_39| 8) (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|)) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_39| 4))) (<= 0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_39| 4)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_29| Int)) (and (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0) 0))) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_29|)) (or (and (= |v_ULTIMATE.start_sll_append_~head#1.base_29| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_75| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_75| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_126| (Array Int Int))) (and (= (select |v_#valid_126| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_126| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_80| (store |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))))))) (and (= |v_ULTIMATE.start_sll_append_~head#1.base_29| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_126| (Array Int Int))) (and (= (select |v_#valid_126| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_126| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_109| (Array Int Int))) (= (store |v_#length_109| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_80| (store |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0) |v_ULTIMATE.start_sll_append_~last~0#1.offset_40|)))))) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:32:08,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:32:08,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:32:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2024-11-14 05:32:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129223325] [2024-11-14 05:32:08,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:32:08,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 05:32:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 05:32:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3806, Unknown=6, NotChecked=124, Total=4160 [2024-11-14 05:32:08,126 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 44 states, 35 states have (on average 1.6) internal successors, (56), 37 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:32:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:10,903 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-14 05:32:10,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:32:10,904 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.6) internal successors, (56), 37 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-14 05:32:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:10,904 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:32:10,904 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:32:10,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=388, Invalid=5930, Unknown=6, NotChecked=156, Total=6480 [2024-11-14 05:32:10,906 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 143 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:10,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 718 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1024 Invalid, 0 Unknown, 87 Unchecked, 1.2s Time] [2024-11-14 05:32:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:32:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-14 05:32:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.5) internal successors, (90), 77 states have internal predecessors, (90), 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-14 05:32:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-14 05:32:10,910 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 34 [2024-11-14 05:32:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:10,911 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-14 05:32:10,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.6) internal successors, (56), 37 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:32:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-14 05:32:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:32:10,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:10,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:10,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 05:32:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 05:32:11,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:32:11,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash -311175064, now seen corresponding path program 1 times [2024-11-14 05:32:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095177135] [2024-11-14 05:32:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:11,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:32:11,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095177135] [2024-11-14 05:32:11,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095177135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:32:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094308845] [2024-11-14 05:32:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:11,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:32:11,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:32:11,843 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:32:11,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:32:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:12,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:32:12,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:12,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-14 05:32:12,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:32:12,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:32:12,427 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-14 05:32:12,428 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 16 treesize of output 18 [2024-11-14 05:32:12,610 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-14 05:32:12,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 23 [2024-11-14 05:32:12,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:32:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 65 treesize of output 51 [2024-11-14 05:32:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:32:12,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:32:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094308845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:32:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:32:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 26 [2024-11-14 05:32:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791089339] [2024-11-14 05:32:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:32:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:32:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:32:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:32:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:32:12,771 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:32:14,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:17,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:19,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:32:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:32:19,540 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2024-11-14 05:32:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:32:19,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-14 05:32:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:32:19,542 INFO L225 Difference]: With dead ends: 121 [2024-11-14 05:32:19,543 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 05:32:19,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 05:32:19,544 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 134 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:32:19,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 368 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 441 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2024-11-14 05:32:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 05:32:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2024-11-14 05:32:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 76 states have internal predecessors, (89), 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-14 05:32:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-14 05:32:19,551 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 36 [2024-11-14 05:32:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:32:19,551 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-14 05:32:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:32:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-14 05:32:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:32:19,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:32:19,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:32:19,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:32:19,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 05:32:19,753 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:32:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:32:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -311175063, now seen corresponding path program 1 times [2024-11-14 05:32:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:32:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876574770] [2024-11-14 05:32:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:19,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:32:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:32:21,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:32:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876574770] [2024-11-14 05:32:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876574770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:32:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919107801] [2024-11-14 05:32:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:32:21,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:32:21,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:32:21,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:32:21,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:32:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:32:21,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-14 05:32:21,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:32:21,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-14 05:32:21,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:32:21,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:32:21,862 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_65| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_65|) 0) (<= (+ |v_node_create_~temp~0#1.base_65| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_65| (select |c_#length| |v_node_create_~temp~0#1.base_65|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_65| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_65|))) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_65| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_65|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-14 05:32:21,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:32:21,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 05:32:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:32:21,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:32:21,909 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:32:21,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 05:32:21,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:32:21,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:32:22,148 INFO L349 Elim1Store]: treesize reduction 37, result has 33.9 percent of original size [2024-11-14 05:32:22,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 31 [2024-11-14 05:32:22,177 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-14 05:32:22,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-14 05:32:22,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:32:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-14 05:32:22,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:32:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919107801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:32:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [758383101] [2024-11-14 05:32:23,262 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:32:23,263 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:32:23,263 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:32:23,263 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:32:23,263 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:32:24,542 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 05:32:24,768 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:33:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [758383101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:33:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:33:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17, 16] total 51 [2024-11-14 05:33:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608310144] [2024-11-14 05:33:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:33:32,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 05:33:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:33:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 05:33:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2971, Unknown=19, NotChecked=110, Total=3306 [2024-11-14 05:33:32,793 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-14 05:33:36,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:39,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:42,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:44,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:46,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:49,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:51,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:54,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:56,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:33:59,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:02,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:04,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:07,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:09,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:12,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:14,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:17,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:19,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:22,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:24,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:26,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:29,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:32,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:34,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:34:37,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:35:06,587 WARN L286 SmtUtils]: Spent 23.13s on a formula simplification. DAG size of input: 190 DAG size of output: 189 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:35:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:24,323 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-14 05:35:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:35:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-14 05:35:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:24,327 INFO L225 Difference]: With dead ends: 104 [2024-11-14 05:35:24,327 INFO L226 Difference]: Without dead ends: 104 [2024-11-14 05:35:24,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 97.9s TimeCoverageRelationStatistics Valid=212, Invalid=3078, Unknown=20, NotChecked=112, Total=3422 [2024-11-14 05:35:24,328 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 4 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:24,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 348 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1066 Invalid, 25 Unknown, 0 Unchecked, 83.3s Time] [2024-11-14 05:35:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-14 05:35:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2024-11-14 05:35:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 85 states have internal predecessors, (100), 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-14 05:35:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2024-11-14 05:35:24,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 36 [2024-11-14 05:35:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:24,332 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2024-11-14 05:35:24,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-14 05:35:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2024-11-14 05:35:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:35:24,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:24,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:24,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:35:24,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:35:24,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:35:24,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:24,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1001799420, now seen corresponding path program 2 times [2024-11-14 05:35:24,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:24,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349239000] [2024-11-14 05:35:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:24,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:35:29,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349239000] [2024-11-14 05:35:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349239000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:35:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195456835] [2024-11-14 05:35:29,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:35:29,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:35:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:35:29,718 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:35:29,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:35:29,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:35:29,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:35:29,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-14 05:35:29,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:35:30,195 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-14 05:35:30,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2024-11-14 05:35:31,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2024-11-14 05:35:32,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:35:32,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-14 05:35:32,069 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 7 treesize of output 3 [2024-11-14 05:35:32,172 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:35:32,172 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 17 treesize of output 21 [2024-11-14 05:35:32,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:35:32,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 05:35:32,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 05:35:33,594 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-11-14 05:35:33,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 58 [2024-11-14 05:35:33,632 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 05:35:33,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2024-11-14 05:35:33,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:35:33,840 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_76| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_76|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_76| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_76|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_76| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_76|))) (<= (+ |v_node_create_~temp~0#1.base_76| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 05:35:33,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:35:33,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:35:33,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:35:33,896 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 05:35:33,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 61 [2024-11-14 05:35:33,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:35:34,018 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 05:35:34,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 78 [2024-11-14 05:35:34,121 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:35:34,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:36:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-14 05:36:01,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:36:05,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195456835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:36:05,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717181451] [2024-11-14 05:36:05,483 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 05:36:05,483 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:36:05,483 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:36:05,483 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:36:05,483 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:36:06,443 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 05:36:06,653 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:36:44,423 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4689#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_58| Int)) (and (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_52| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_57| Int)) (and (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_57|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_57|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4)) |ULTIMATE.start_sll_append_~last~0#1.offset|) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_58| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_57|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4))) (<= 0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 4)) (<= (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_52| 8) (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_57|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_33| Int)) (and (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) |ULTIMATE.start_sll_append_~last~0#1.offset|) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_58| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 0))) (or (and (exists ((|v_#valid_147| (Array Int Int))) (and (= (store |v_#valid_147| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_147| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#length_127| (Array Int Int))) (= (store |v_#length_127| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_33| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_105| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_106| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_106|))) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_159| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_76| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_76| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_76| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_76| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_159| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| (store |v_#memory_$Pointer$.base_163| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_163| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_76| (store |v_#memory_int_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_76| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.offset_155| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#valid_147| (Array Int Int))) (and (= (store |v_#valid_147| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_147| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#length_127| (Array Int Int))) (= (store |v_#length_127| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_33| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_105| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_106| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_106|))) (exists ((|v_#memory_$Pointer$.offset_159| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_77| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_77| (Array Int Int)) (|v_#length_BEFORE_CALL_121| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_77| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_159| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_121| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_77| (store |v_#memory_int_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| (store |v_#memory_$Pointer$.base_163| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_163| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_77| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.offset_155| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_33|))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_58|) 1)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:36:44,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:36:44,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:36:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 41 [2024-11-14 05:36:44,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721500515] [2024-11-14 05:36:44,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:36:44,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 05:36:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:44,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 05:36:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3578, Unknown=12, NotChecked=120, Total=3906 [2024-11-14 05:36:44,430 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 41 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 35 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:36:51,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:00,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:04,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:06,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:08,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:10,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:12,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:17,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:19,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:23,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:26,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:28,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:31,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:34,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:36,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:40,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:37:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:40,234 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2024-11-14 05:37:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:37:40,234 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 35 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-14 05:37:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:40,236 INFO L225 Difference]: With dead ends: 110 [2024-11-14 05:37:40,236 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 05:37:40,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=293, Invalid=5399, Unknown=12, NotChecked=148, Total=5852 [2024-11-14 05:37:40,237 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 12 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:40,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1009 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1128 Invalid, 15 Unknown, 98 Unchecked, 37.9s Time] [2024-11-14 05:37:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 05:37:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2024-11-14 05:37:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 97 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:37:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2024-11-14 05:37:40,242 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 37 [2024-11-14 05:37:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:40,243 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2024-11-14 05:37:40,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 35 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 05:37:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2024-11-14 05:37:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:37:40,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:40,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:40,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:37:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:40,444 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:37:40,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 490504463, now seen corresponding path program 1 times [2024-11-14 05:37:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957113888] [2024-11-14 05:37:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:37:41,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957113888] [2024-11-14 05:37:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957113888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518849243] [2024-11-14 05:37:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:41,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:37:41,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:37:41,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:37:41,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:37:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:41,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:37:41,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:37:42,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 05:37:42,092 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_86| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_86| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_86| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_86|))))) is different from true [2024-11-14 05:37:42,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:37:42,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:37:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:37:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-11-14 05:37:42,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:37:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518849243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:37:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069772984] [2024-11-14 05:37:42,408 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-14 05:37:42,408 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:37:42,408 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:37:42,409 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:37:42,409 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:37:43,256 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 117 for LOIs [2024-11-14 05:37:43,576 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:38:10,453 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5116#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_173| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~head#1.base_35| Int)) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_181| |v_ULTIMATE.start_sll_append_~head#1.base_35| (store (select |v_#memory_$Pointer$.base_181| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)))) (or (and (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_119| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (select |v_#memory_int_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0 5)) |v_#memory_int_123|) (= (store |v_#memory_int_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (select |v_#memory_int_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4 (select (select |v_#memory_int_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4))) |v_#memory_int_119|))) (= |v_ULTIMATE.start_sll_append_~head#1.base_35| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_134| (Array Int Int))) (= |#length| (store |v_#length_134| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 8))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_135| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_135| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (store (select |v_#memory_$Pointer$.offset_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_173| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0))) |v_#memory_$Pointer$.offset_173|)) (exists ((|v_#valid_154| (Array Int Int))) (and (= (store |v_#valid_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 1) |#valid|) (= (select |v_#valid_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 0)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_176| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_176| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (store (select |v_#memory_$Pointer$.base_176| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_181| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0))) |v_#memory_$Pointer$.base_181|))) (and (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_119| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (select |v_#memory_int_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0 5)) |v_#memory_int_123|) (= (store |v_#memory_int_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (select |v_#memory_int_118| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4 (select (select |v_#memory_int_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4))) |v_#memory_int_119|))) (= |v_ULTIMATE.start_sll_append_~head#1.base_35| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_88| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_88| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#length_134| (Array Int Int))) (= |#length| (store |v_#length_134| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 8))) (exists ((|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (store (select |v_#memory_$Pointer$.offset_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_173| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0))) |v_#memory_$Pointer$.offset_173|)) (exists ((|v_#valid_154| (Array Int Int))) (and (= (store |v_#valid_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 1) |#valid|) (= (select |v_#valid_154| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 0)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_176| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_176| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) (store (store (select |v_#memory_$Pointer$.base_176| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_181| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)) 0))) |v_#memory_$Pointer$.base_181|)))) (= (select (select |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_append_~head#1.base_35| (store (select |v_#memory_$Pointer$.offset_173| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0 0))) (= |#memory_int| (store |v_#memory_int_123| |v_ULTIMATE.start_sll_append_~head#1.base_35| (store (select |v_#memory_int_123| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0)))) (= (select (select |v_#memory_$Pointer$.base_181| |v_ULTIMATE.start_sll_append_~head#1.base_35|) 0) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:38:10,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:38:10,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:38:10,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2024-11-14 05:38:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121384273] [2024-11-14 05:38:10,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:38:10,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:38:10,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:38:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1148, Unknown=6, NotChecked=68, Total=1332 [2024-11-14 05:38:10,455 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 17 states, 12 states have (on average 2.75) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:12,598 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2024-11-14 05:38:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:38:12,599 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.75) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-14 05:38:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:12,600 INFO L225 Difference]: With dead ends: 94 [2024-11-14 05:38:12,600 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 05:38:12,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=149, Invalid=1571, Unknown=6, NotChecked=80, Total=1806 [2024-11-14 05:38:12,601 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:12,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 499 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 69 Unchecked, 1.3s Time] [2024-11-14 05:38:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 05:38:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-14 05:38:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 87 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:38:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-11-14 05:38:12,605 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 38 [2024-11-14 05:38:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:12,606 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-11-14 05:38:12,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.75) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:38:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-11-14 05:38:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:38:12,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:12,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:12,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:38:12,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:12,808 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:38:12,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash -658331836, now seen corresponding path program 1 times [2024-11-14 05:38:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:12,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232564590] [2024-11-14 05:38:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:38:18,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232564590] [2024-11-14 05:38:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232564590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424679837] [2024-11-14 05:38:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:18,086 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:18,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:38:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:18,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-14 05:38:18,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:18,393 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-14 05:38:20,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-14 05:38:20,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:38:20,273 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-14 05:38:20,289 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-14 05:38:21,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:21,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:38:21,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:21,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-14 05:38:21,603 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:38:21,604 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 15 treesize of output 15 [2024-11-14 05:38:21,635 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 18 treesize of output 13 [2024-11-14 05:38:23,028 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-14 05:38:23,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 38 [2024-11-14 05:38:23,122 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-14 05:38:23,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2024-11-14 05:38:23,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:23,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 110 treesize of output 78 [2024-11-14 05:38:23,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:23,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 68 treesize of output 72 [2024-11-14 05:38:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:38:24,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:38:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424679837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:38:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 36 [2024-11-14 05:38:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364879442] [2024-11-14 05:38:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:24,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:38:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:38:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2024-11-14 05:38:24,995 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:38:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:28,926 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2024-11-14 05:38:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:38:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-14 05:38:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:28,928 INFO L225 Difference]: With dead ends: 115 [2024-11-14 05:38:28,928 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 05:38:28,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=131, Invalid=1591, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 05:38:28,929 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 136 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:28,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 352 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:38:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 05:38:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2024-11-14 05:38:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 87 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:38:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2024-11-14 05:38:28,935 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 39 [2024-11-14 05:38:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:28,935 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2024-11-14 05:38:28,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 05:38:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2024-11-14 05:38:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 05:38:28,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:28,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:28,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 05:38:29,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-14 05:38:29,137 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:38:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -819209435, now seen corresponding path program 1 times [2024-11-14 05:38:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758492138] [2024-11-14 05:38:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:38:32,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758492138] [2024-11-14 05:38:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758492138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400076274] [2024-11-14 05:38:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:32,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:32,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:32,701 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:32,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:38:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:32,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-14 05:38:32,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:32,957 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-14 05:38:33,197 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-14 05:38:33,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:33,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 05:38:34,704 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-14 05:38:35,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:35,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 05:38:36,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:38:36,905 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-14 05:38:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 27 [2024-11-14 05:38:36,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-14 05:38:36,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:38:36,942 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-14 05:38:38,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:38,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2024-11-14 05:38:38,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:38,390 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:38:38,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 61 [2024-11-14 05:38:38,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:38:38,443 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-14 05:38:38,505 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 05:38:38,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 05:38:39,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:39,819 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 13 treesize of output 17 [2024-11-14 05:38:40,972 INFO L349 Elim1Store]: treesize reduction 65, result has 29.3 percent of original size [2024-11-14 05:38:40,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 58 [2024-11-14 05:38:40,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2024-11-14 05:38:42,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:38:42,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 115 [2024-11-14 05:38:43,050 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-14 05:38:43,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 25 [2024-11-14 05:38:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:38:43,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400076274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [755591332] [2024-11-14 05:38:47,185 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-14 05:38:47,185 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:38:47,185 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:38:47,185 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:38:47,185 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:38:48,310 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 05:38:48,567 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:40:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [755591332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:40:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [22, 25] total 66 [2024-11-14 05:40:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759303264] [2024-11-14 05:40:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:27,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 05:40:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 05:40:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4968, Unknown=22, NotChecked=0, Total=5256 [2024-11-14 05:40:27,364 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 22 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-14 05:40:32,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:34,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:37,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:40,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:42,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:45,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:48,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:50,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:53,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:55,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:40:58,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:00,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:03,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:05,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:07,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:10,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:12,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:14,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:17,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:19,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:22,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:41:58,624 WARN L286 SmtUtils]: Spent 26.53s on a formula simplification. DAG size of input: 190 DAG size of output: 189 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:43:42,233 WARN L286 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 207 DAG size of output: 198 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:44:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:01,653 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-11-14 05:44:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:44:01,654 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-14 05:44:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:01,655 INFO L225 Difference]: With dead ends: 110 [2024-11-14 05:44:01,655 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 05:44:01,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 247.6s TimeCoverageRelationStatistics Valid=280, Invalid=5244, Unknown=26, NotChecked=0, Total=5550 [2024-11-14 05:44:01,660 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 1 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:01,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 243 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1011 Invalid, 21 Unknown, 0 Unchecked, 77.7s Time] [2024-11-14 05:44:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 05:44:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2024-11-14 05:44:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.380281690140845) internal successors, (98), 86 states have internal predecessors, (98), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 05:44:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2024-11-14 05:44:01,668 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 41 [2024-11-14 05:44:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:01,669 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2024-11-14 05:44:01,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-14 05:44:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2024-11-14 05:44:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:44:01,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:01,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:01,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 05:44:01,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:01,871 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-14 05:44:01,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash 44353844, now seen corresponding path program 1 times [2024-11-14 05:44:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276564180] [2024-11-14 05:44:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:44:05,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276564180] [2024-11-14 05:44:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276564180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:05,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787253191] [2024-11-14 05:44:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:05,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:05,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:05,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:05,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b61e5c25-a19a-4e67-a59b-3e2132304a81/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:44:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:05,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-14 05:44:05,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:05,874 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-14 05:44:08,114 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:44:08,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-14 05:44:08,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:44:09,998 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-14 05:44:09,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-14 05:44:10,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:44:10,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:44:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:11,573 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 05:44:11,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 55 [2024-11-14 05:44:11,822 INFO L349 Elim1Store]: treesize reduction 78, result has 37.6 percent of original size [2024-11-14 05:44:11,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 61 [2024-11-14 05:44:11,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:11,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:44:15,143 INFO L349 Elim1Store]: treesize reduction 86, result has 30.1 percent of original size [2024-11-14 05:44:15,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 86 [2024-11-14 05:44:15,291 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-14 05:44:15,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-14 05:44:16,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2024-11-14 05:44:20,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:20,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 247 treesize of output 305 [2024-11-14 05:44:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:44:32,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787253191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2080623081] [2024-11-14 05:44:37,794 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 05:44:37,794 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:44:37,794 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:44:37,794 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:44:37,794 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:44:39,510 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-14 05:44:39,824 INFO L180 IcfgInterpreter]: Interpretation finished