./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.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_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/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_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/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_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:03:09,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:03:09,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 04:03:09,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:03:09,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:03:09,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:03:09,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:03:09,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:03:09,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:03:09,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:03:09,588 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:03:09,588 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:03:09,588 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:03:09,589 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:03:09,589 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:03:09,589 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:03:09,589 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:03:09,589 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:03:09,589 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:03:09,590 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:03:09,590 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:03:09,590 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:03:09,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:03:09,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:03:09,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:03:09,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:03:09,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:03:09,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:03:09,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:03:09,593 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:03:09,593 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:03:09,593 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:03:09,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:03:09,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:03:09,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:03:09,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:03:09,594 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:03:09,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:03:09,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:03:09,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:03:09,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:03:09,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:03:09,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:03:09,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:03:09,596 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:03:09,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:03:09,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:03:09,596 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:03:09,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:03:09,596 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_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-14 04:03:09,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:03:09,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:03:09,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:03:09,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:03:09,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:03:09,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i Unable to find full path for "g++" [2024-11-14 04:03:12,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:03:12,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:03:12,817 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-11-14 04:03:12,846 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/data/7dc41ebc8/c2fae0118ccb4f4ea8f4b758b339d392/FLAG0e5a9394b [2024-11-14 04:03:12,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/data/7dc41ebc8/c2fae0118ccb4f4ea8f4b758b339d392 [2024-11-14 04:03:12,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:03:12,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:03:12,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:03:12,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:03:12,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:03:12,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:03:12" (1/1) ... [2024-11-14 04:03:12,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e41e2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:12, skipping insertion in model container [2024-11-14 04:03:12,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:03:12" (1/1) ... [2024-11-14 04:03:12,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:03:13,464 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:03:13,538 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:03:13,543 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:03:13,556 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:03:13,566 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:03:13,584 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:03:13,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:03:13,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:03:13,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:03:13,760 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:03:13,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13 WrapperNode [2024-11-14 04:03:13,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:03:13,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:03:13,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:03:13,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:03:13,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,865 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-14 04:03:13,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:03:13,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:03:13,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:03:13,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:03:13,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:03:13,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:03:13,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:03:13,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:03:13,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (1/1) ... [2024-11-14 04:03:13,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:03:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:14,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:03:14,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:03:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:03:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:03:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 04:03:14,066 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 04:03:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:03:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:03:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:03:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:03:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:03:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:03:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:03:14,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:03:14,351 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:03:14,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:03:14,358 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 04:03:16,944 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-14 04:03:16,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:03:18,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:03:18,179 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-14 04:03:18,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:03:18 BoogieIcfgContainer [2024-11-14 04:03:18,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:03:18,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:03:18,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:03:18,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:03:18,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:03:12" (1/3) ... [2024-11-14 04:03:18,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a40cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:03:18, skipping insertion in model container [2024-11-14 04:03:18,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:03:13" (2/3) ... [2024-11-14 04:03:18,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a40cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:03:18, skipping insertion in model container [2024-11-14 04:03:18,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:03:18" (3/3) ... [2024-11-14 04:03:18,200 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2024-11-14 04:03:18,218 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:03:18,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-1.i that has 2 procedures, 565 locations, 1 initial locations, 19 loop locations, and 320 error locations. [2024-11-14 04:03:18,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:03:18,317 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;@61aa0ecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:03:18,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-14 04:03:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 565 states, 243 states have (on average 2.54320987654321) internal successors, (618), 560 states have internal predecessors, (618), 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 04:03:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:03:18,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:18,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:03:18,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1328005, now seen corresponding path program 1 times [2024-11-14 04:03:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:18,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236553540] [2024-11-14 04:03:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:18,650 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 04:03:18,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236553540] [2024-11-14 04:03:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236553540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:03:18,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429480702] [2024-11-14 04:03:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:03:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:18,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:03:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:03:18,704 INFO L87 Difference]: Start difference. First operand has 565 states, 243 states have (on average 2.54320987654321) internal successors, (618), 560 states have internal predecessors, (618), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:20,913 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 [] [2024-11-14 04:03:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:22,380 INFO L93 Difference]: Finished difference Result 507 states and 535 transitions. [2024-11-14 04:03:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:03:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 04:03:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:22,405 INFO L225 Difference]: With dead ends: 507 [2024-11-14 04:03:22,405 INFO L226 Difference]: Without dead ends: 506 [2024-11-14 04:03:22,406 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 04:03:22,414 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 452 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:22,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 219 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2024-11-14 04:03:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-14 04:03:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 505. [2024-11-14 04:03:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 238 states have (on average 2.2100840336134455) internal successors, (526), 500 states have internal predecessors, (526), 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 04:03:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 532 transitions. [2024-11-14 04:03:22,539 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 532 transitions. Word has length 3 [2024-11-14 04:03:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:22,540 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 532 transitions. [2024-11-14 04:03:22,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 532 transitions. [2024-11-14 04:03:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:03:22,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:22,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:03:22,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:03:22,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1328006, now seen corresponding path program 1 times [2024-11-14 04:03:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522713090] [2024-11-14 04:03:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:22,696 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 04:03:22,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522713090] [2024-11-14 04:03:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522713090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:03:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994794444] [2024-11-14 04:03:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:22,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:03:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:03:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:03:22,699 INFO L87 Difference]: Start difference. First operand 505 states and 532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:24,834 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 [] [2024-11-14 04:03:26,863 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 [] [2024-11-14 04:03:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:27,655 INFO L93 Difference]: Finished difference Result 567 states and 598 transitions. [2024-11-14 04:03:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:03:27,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 04:03:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:27,662 INFO L225 Difference]: With dead ends: 567 [2024-11-14 04:03:27,663 INFO L226 Difference]: Without dead ends: 567 [2024-11-14 04:03:27,664 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 04:03:27,665 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 233 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:27,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 491 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2024-11-14 04:03:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-14 04:03:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 521. [2024-11-14 04:03:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 265 states have (on average 2.1849056603773587) internal successors, (579), 516 states have internal predecessors, (579), 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 04:03:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 585 transitions. [2024-11-14 04:03:27,722 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 585 transitions. Word has length 3 [2024-11-14 04:03:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:27,722 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 585 transitions. [2024-11-14 04:03:27,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 585 transitions. [2024-11-14 04:03:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 04:03:27,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:27,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 04:03:27,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:03:27,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:27,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash 41316393, now seen corresponding path program 1 times [2024-11-14 04:03:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:27,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893646209] [2024-11-14 04:03:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:27,782 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 04:03:27,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893646209] [2024-11-14 04:03:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893646209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:27,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:03:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312677353] [2024-11-14 04:03:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:27,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:03:27,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:27,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:03:27,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:03:27,786 INFO L87 Difference]: Start difference. First operand 521 states and 585 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:29,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:31,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:34,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:36,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:38,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:40,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:40,277 INFO L93 Difference]: Finished difference Result 1025 states and 1152 transitions. [2024-11-14 04:03:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:03:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 04:03:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:40,283 INFO L225 Difference]: With dead ends: 1025 [2024-11-14 04:03:40,284 INFO L226 Difference]: Without dead ends: 1025 [2024-11-14 04:03:40,284 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 04:03:40,285 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 496 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:40,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 892 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 12.4s Time] [2024-11-14 04:03:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2024-11-14 04:03:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 522. [2024-11-14 04:03:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 266 states have (on average 2.180451127819549) internal successors, (580), 517 states have internal predecessors, (580), 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 04:03:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 586 transitions. [2024-11-14 04:03:40,309 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 586 transitions. Word has length 4 [2024-11-14 04:03:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:40,310 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 586 transitions. [2024-11-14 04:03:40,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 586 transitions. [2024-11-14 04:03:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:03:40,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:40,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:03:40,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:03:40,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:40,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:40,312 INFO L85 PathProgramCache]: Analyzing trace with hash -764649336, now seen corresponding path program 1 times [2024-11-14 04:03:40,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:40,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307680792] [2024-11-14 04:03:40,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:40,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:40,498 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 04:03:40,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307680792] [2024-11-14 04:03:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307680792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:03:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245990218] [2024-11-14 04:03:40,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:03:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:03:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:03:40,501 INFO L87 Difference]: Start difference. First operand 522 states and 586 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:42,644 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 [] [2024-11-14 04:03:44,694 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 [] [2024-11-14 04:03:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:46,046 INFO L93 Difference]: Finished difference Result 503 states and 567 transitions. [2024-11-14 04:03:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:03:46,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 04:03:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:46,051 INFO L225 Difference]: With dead ends: 503 [2024-11-14 04:03:46,051 INFO L226 Difference]: Without dead ends: 503 [2024-11-14 04:03:46,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:03:46,052 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 488 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:46,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 339 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 658 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2024-11-14 04:03:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-14 04:03:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2024-11-14 04:03:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 266 states have (on average 2.093984962406015) internal successors, (557), 494 states have internal predecessors, (557), 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 04:03:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 563 transitions. [2024-11-14 04:03:46,072 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 563 transitions. Word has length 10 [2024-11-14 04:03:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:46,072 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 563 transitions. [2024-11-14 04:03:46,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 563 transitions. [2024-11-14 04:03:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:03:46,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:46,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:03:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:03:46,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -764649335, now seen corresponding path program 1 times [2024-11-14 04:03:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850588862] [2024-11-14 04:03:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:46,272 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 04:03:46,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850588862] [2024-11-14 04:03:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850588862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:46,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:03:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661070659] [2024-11-14 04:03:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:03:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:03:46,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:03:46,276 INFO L87 Difference]: Start difference. First operand 499 states and 563 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:48,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:50,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:50,554 INFO L93 Difference]: Finished difference Result 472 states and 535 transitions. [2024-11-14 04:03:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:03:50,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 04:03:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:50,557 INFO L225 Difference]: With dead ends: 472 [2024-11-14 04:03:50,557 INFO L226 Difference]: Without dead ends: 472 [2024-11-14 04:03:50,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:03:50,558 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 50 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:50,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 748 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2024-11-14 04:03:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-14 04:03:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-11-14 04:03:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 251 states have (on average 2.1075697211155378) internal successors, (529), 467 states have internal predecessors, (529), 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 04:03:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 535 transitions. [2024-11-14 04:03:50,573 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 535 transitions. Word has length 10 [2024-11-14 04:03:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:50,574 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 535 transitions. [2024-11-14 04:03:50,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 535 transitions. [2024-11-14 04:03:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:03:50,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:50,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:03:50,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:03:50,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2066966254, now seen corresponding path program 1 times [2024-11-14 04:03:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577669225] [2024-11-14 04:03:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:50,737 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 04:03:50,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577669225] [2024-11-14 04:03:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577669225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:50,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:03:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027185836] [2024-11-14 04:03:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:03:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:03:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:03:50,739 INFO L87 Difference]: Start difference. First operand 472 states and 535 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:52,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:54,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:56,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:03:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:57,092 INFO L93 Difference]: Finished difference Result 461 states and 517 transitions. [2024-11-14 04:03:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:03:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:03:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:57,095 INFO L225 Difference]: With dead ends: 461 [2024-11-14 04:03:57,095 INFO L226 Difference]: Without dead ends: 461 [2024-11-14 04:03:57,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:03:57,096 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 38 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:57,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1087 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 210 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-14 04:03:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-14 04:03:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 458. [2024-11-14 04:03:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 244 states have (on average 2.081967213114754) internal successors, (508), 453 states have internal predecessors, (508), 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 04:03:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 514 transitions. [2024-11-14 04:03:57,115 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 514 transitions. Word has length 11 [2024-11-14 04:03:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 514 transitions. [2024-11-14 04:03:57,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 514 transitions. [2024-11-14 04:03:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 04:03:57,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:57,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:03:57,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:03:57,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:03:57,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1884602108, now seen corresponding path program 1 times [2024-11-14 04:03:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:03:57,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217584992] [2024-11-14 04:03:57,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:03:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:57,434 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 04:03:57,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:03:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217584992] [2024-11-14 04:03:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217584992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:03:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:03:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:03:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033692913] [2024-11-14 04:03:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:03:57,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:03:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:03:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:03:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:03:57,436 INFO L87 Difference]: Start difference. First operand 458 states and 514 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:59,499 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 [] [2024-11-14 04:04:01,504 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 [] [2024-11-14 04:04:03,513 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 [] [2024-11-14 04:04:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:04,376 INFO L93 Difference]: Finished difference Result 452 states and 509 transitions. [2024-11-14 04:04:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:04:04,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 04:04:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:04,381 INFO L225 Difference]: With dead ends: 452 [2024-11-14 04:04:04,381 INFO L226 Difference]: Without dead ends: 452 [2024-11-14 04:04:04,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:04:04,382 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 216 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:04,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 524 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 538 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2024-11-14 04:04:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-14 04:04:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 412. [2024-11-14 04:04:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 217 states have (on average 1.9585253456221199) internal successors, (425), 407 states have internal predecessors, (425), 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 04:04:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 431 transitions. [2024-11-14 04:04:04,397 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 431 transitions. Word has length 25 [2024-11-14 04:04:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:04,397 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 431 transitions. [2024-11-14 04:04:04,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 431 transitions. [2024-11-14 04:04:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 04:04:04,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:04,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:04,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 04:04:04,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:04,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -264006104, now seen corresponding path program 1 times [2024-11-14 04:04:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140287672] [2024-11-14 04:04:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:04,669 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 04:04:04,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140287672] [2024-11-14 04:04:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140287672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:04:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:04:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328725144] [2024-11-14 04:04:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:04:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:04:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:04:04,674 INFO L87 Difference]: Start difference. First operand 412 states and 431 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:06,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:08,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:10,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:11,011 INFO L93 Difference]: Finished difference Result 412 states and 427 transitions. [2024-11-14 04:04:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:04:11,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-14 04:04:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:11,014 INFO L225 Difference]: With dead ends: 412 [2024-11-14 04:04:11,014 INFO L226 Difference]: Without dead ends: 412 [2024-11-14 04:04:11,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:04:11,015 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 15 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:11,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1030 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-14 04:04:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-14 04:04:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-11-14 04:04:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 217 states have (on average 1.9400921658986174) internal successors, (421), 407 states have internal predecessors, (421), 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 04:04:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 427 transitions. [2024-11-14 04:04:11,036 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 427 transitions. Word has length 41 [2024-11-14 04:04:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:11,037 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 427 transitions. [2024-11-14 04:04:11,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 427 transitions. [2024-11-14 04:04:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 04:04:11,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:11,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:11,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:04:11,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1951013238, now seen corresponding path program 1 times [2024-11-14 04:04:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485505885] [2024-11-14 04:04:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:11,301 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 04:04:11,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485505885] [2024-11-14 04:04:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485505885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:11,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:04:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:04:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268831803] [2024-11-14 04:04:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:04:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:04:11,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:04:11,304 INFO L87 Difference]: Start difference. First operand 412 states and 427 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:13,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:15,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:17,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:17,609 INFO L93 Difference]: Finished difference Result 454 states and 469 transitions. [2024-11-14 04:04:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:04:17,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-14 04:04:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:17,613 INFO L225 Difference]: With dead ends: 454 [2024-11-14 04:04:17,613 INFO L226 Difference]: Without dead ends: 454 [2024-11-14 04:04:17,614 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 04:04:17,614 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:17,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2024-11-14 04:04:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-14 04:04:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-11-14 04:04:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 259 states have (on average 1.7876447876447876) internal successors, (463), 449 states have internal predecessors, (463), 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 04:04:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 469 transitions. [2024-11-14 04:04:17,631 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 469 transitions. Word has length 45 [2024-11-14 04:04:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 469 transitions. [2024-11-14 04:04:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 469 transitions. [2024-11-14 04:04:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 04:04:17,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:17,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:17,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:04:17,634 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:17,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:17,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1196377731, now seen corresponding path program 1 times [2024-11-14 04:04:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183526821] [2024-11-14 04:04:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:18,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:18,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183526821] [2024-11-14 04:04:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183526821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:18,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:04:18,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:04:18,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910940299] [2024-11-14 04:04:18,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:18,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:04:18,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:04:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:04:18,862 INFO L87 Difference]: Start difference. First operand 454 states and 469 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:20,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:22,937 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 [] [2024-11-14 04:04:24,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 [] [2024-11-14 04:04:26,943 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 [] [2024-11-14 04:04:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:27,853 INFO L93 Difference]: Finished difference Result 453 states and 468 transitions. [2024-11-14 04:04:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:04:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-14 04:04:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:27,856 INFO L225 Difference]: With dead ends: 453 [2024-11-14 04:04:27,856 INFO L226 Difference]: Without dead ends: 453 [2024-11-14 04:04:27,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:04:27,857 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 2 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:27,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 873 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 815 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2024-11-14 04:04:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-14 04:04:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-14 04:04:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 259 states have (on average 1.7837837837837838) internal successors, (462), 448 states have internal predecessors, (462), 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 04:04:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 468 transitions. [2024-11-14 04:04:27,866 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 468 transitions. Word has length 52 [2024-11-14 04:04:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:27,866 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 468 transitions. [2024-11-14 04:04:27,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 468 transitions. [2024-11-14 04:04:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 04:04:27,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:27,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:27,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:04:27,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:27,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:27,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1196377732, now seen corresponding path program 1 times [2024-11-14 04:04:27,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:27,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155568832] [2024-11-14 04:04:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:27,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:28,463 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 04:04:28,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155568832] [2024-11-14 04:04:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155568832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:04:28,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:04:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783629594] [2024-11-14 04:04:28,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:04:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:04:28,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:04:28,470 INFO L87 Difference]: Start difference. First operand 453 states and 468 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:30,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:32,550 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 [] [2024-11-14 04:04:34,563 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 [] [2024-11-14 04:04:36,566 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 [] [2024-11-14 04:04:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:37,293 INFO L93 Difference]: Finished difference Result 452 states and 467 transitions. [2024-11-14 04:04:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:04:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-14 04:04:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:37,296 INFO L225 Difference]: With dead ends: 452 [2024-11-14 04:04:37,297 INFO L226 Difference]: Without dead ends: 452 [2024-11-14 04:04:37,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:04:37,298 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:37,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 910 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 4 Unknown, 0 Unchecked, 8.8s Time] [2024-11-14 04:04:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-14 04:04:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-11-14 04:04:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 258 states have (on average 1.7868217054263567) internal successors, (461), 447 states have internal predecessors, (461), 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 04:04:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 467 transitions. [2024-11-14 04:04:37,314 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 467 transitions. Word has length 52 [2024-11-14 04:04:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:37,315 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 467 transitions. [2024-11-14 04:04:37,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 467 transitions. [2024-11-14 04:04:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 04:04:37,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:37,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:37,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:04:37,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -344843806, now seen corresponding path program 1 times [2024-11-14 04:04:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900525251] [2024-11-14 04:04:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:37,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900525251] [2024-11-14 04:04:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900525251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:37,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:04:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:04:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050275976] [2024-11-14 04:04:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:37,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:04:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:37,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:04:37,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:04:37,779 INFO L87 Difference]: Start difference. First operand 452 states and 467 transitions. Second operand has 7 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 04:04:39,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:41,867 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 [] [2024-11-14 04:04:43,876 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 [] [2024-11-14 04:04:45,886 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 [] [2024-11-14 04:04:47,889 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 [] [2024-11-14 04:04:49,894 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 [] [2024-11-14 04:04:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:50,764 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2024-11-14 04:04:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:04:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 58 [2024-11-14 04:04:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:50,769 INFO L225 Difference]: With dead ends: 462 [2024-11-14 04:04:50,769 INFO L226 Difference]: Without dead ends: 462 [2024-11-14 04:04:50,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 04:04:50,770 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 5 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:50,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1254 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 859 Invalid, 6 Unknown, 0 Unchecked, 12.9s Time] [2024-11-14 04:04:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-14 04:04:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 457. [2024-11-14 04:04:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 262 states have (on average 1.782442748091603) internal successors, (467), 451 states have internal predecessors, (467), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 04:04:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 476 transitions. [2024-11-14 04:04:50,783 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 476 transitions. Word has length 58 [2024-11-14 04:04:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 476 transitions. [2024-11-14 04:04:50,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 04:04:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 476 transitions. [2024-11-14 04:04:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 04:04:50,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:50,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:50,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:04:50,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -344843805, now seen corresponding path program 1 times [2024-11-14 04:04:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203390005] [2024-11-14 04:04:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:51,627 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 04:04:51,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203390005] [2024-11-14 04:04:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203390005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:04:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:04:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:04:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700798704] [2024-11-14 04:04:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:51,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:04:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:04:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:04:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:04:51,628 INFO L87 Difference]: Start difference. First operand 457 states and 476 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 04:04:53,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:54,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:04:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:55,814 INFO L93 Difference]: Finished difference Result 457 states and 475 transitions. [2024-11-14 04:04:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:04:55,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 58 [2024-11-14 04:04:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:55,817 INFO L225 Difference]: With dead ends: 457 [2024-11-14 04:04:55,817 INFO L226 Difference]: Without dead ends: 457 [2024-11-14 04:04:55,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:04:55,818 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:55,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1156 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 954 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-14 04:04:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-14 04:04:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2024-11-14 04:04:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 262 states have (on average 1.7786259541984732) internal successors, (466), 451 states have internal predecessors, (466), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 04:04:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 475 transitions. [2024-11-14 04:04:55,831 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 475 transitions. Word has length 58 [2024-11-14 04:04:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:55,832 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 475 transitions. [2024-11-14 04:04:55,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 04:04:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 475 transitions. [2024-11-14 04:04:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 04:04:55,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:55,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:04:55,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:04:55,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:04:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash -637794225, now seen corresponding path program 1 times [2024-11-14 04:04:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:04:55,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635213293] [2024-11-14 04:04:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:04:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:56,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:04:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635213293] [2024-11-14 04:04:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635213293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:04:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350187339] [2024-11-14 04:04:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:56,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:04:56,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:04:56,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:04:56,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:04:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:56,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 04:04:56,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:04:57,034 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 04:04:57,192 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 04:04:57,192 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 04:04:57,248 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 19 treesize of output 1 [2024-11-14 04:04:57,367 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 22 treesize of output 10 [2024-11-14 04:04:57,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:04:57,586 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 04:04:57,645 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 31 treesize of output 13 [2024-11-14 04:04:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:57,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:57,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-14 04:04:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350187339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:04:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [494975366] [2024-11-14 04:04:57,780 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2024-11-14 04:04:57,781 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:04:57,785 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:04:57,790 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:04:57,790 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:05:04,455 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-14 04:05:04,856 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:07:53,976 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13597#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_18| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr160_18|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_18| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_280| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_282| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_279| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_282| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_282|) (= (store |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_280|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_284| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_283| (Array Int (Array Int Int))) (|v_#valid_481| (Array Int Int)) (|v_#length_468| (Array Int Int)) (|v_#memory_$Pointer$.base_286| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (select |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_#memory_$Pointer$.base_286| (store |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= |v_#memory_$Pointer$.base_284| (store |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_468| |ULTIMATE.start_main_~user~0#1.base|)) (= (select |v_#valid_481| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#length| (store |v_#length_468| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (store |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))))) (exists ((|v_#memory_int_335| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_334| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int))) (|v_#memory_int_332| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_334|) (= (store |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_335|) (= |v_old(#memory_int)_AFTER_CALL_3| (store |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_332|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr160_18| Int)) (and (<= 1 |v_#Ultimate.C_memset_#t~loopctr160_18|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_18| 4294967296)))) (exists ((|v_#memory_$Pointer$.offset_280| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_282| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_279| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_282| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_282|) (= (store |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_279| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_280| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_280|))) (exists ((|v_#memory_$Pointer$.base_284| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_283| (Array Int (Array Int Int))) (|v_#valid_481| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#length_468| (Array Int Int)) (|v_#memory_$Pointer$.base_286| (Array Int (Array Int Int)))) (and (= (select |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#valid_481| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_#memory_$Pointer$.base_286| (store |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_286| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= |v_#memory_$Pointer$.base_284| (store |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_283| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_284| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (<= 40 (select |v_#length_468| |ULTIMATE.start_main_~user~0#1.base|)) (= (select |v_#valid_481| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#length_468| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_int_335| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_334| (Array Int (Array Int Int))) (|v_#memory_int_330| (Array Int (Array Int Int))) (|v_#memory_int_332| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_334|) (= (store |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_334| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_335|) (= (store |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_330| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_332| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_332|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_335| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))))))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem53#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)))' at error location [2024-11-14 04:07:53,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:07:53,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:07:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-14 04:07:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760610793] [2024-11-14 04:07:53,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:07:53,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 04:07:53,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:07:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 04:07:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2236, Unknown=90, NotChecked=98, Total=2652 [2024-11-14 04:07:53,981 INFO L87 Difference]: Start difference. First operand 457 states and 475 transitions. Second operand has 19 states, 16 states have (on average 6.3125) internal successors, (101), 18 states have internal predecessors, (101), 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 04:07:56,441 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 [] [2024-11-14 04:07:57,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:08:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:08:06,380 INFO L93 Difference]: Finished difference Result 461 states and 479 transitions. [2024-11-14 04:08:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:08:06,381 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 18 states have internal predecessors, (101), 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 59 [2024-11-14 04:08:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:08:06,384 INFO L225 Difference]: With dead ends: 461 [2024-11-14 04:08:06,385 INFO L226 Difference]: Without dead ends: 461 [2024-11-14 04:08:06,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 169.9s TimeCoverageRelationStatistics Valid=260, Invalid=2621, Unknown=93, NotChecked=106, Total=3080 [2024-11-14 04:08:06,388 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 344 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:08:06,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1937 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3102 Invalid, 1 Unknown, 0 Unchecked, 11.9s Time] [2024-11-14 04:08:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-14 04:08:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2024-11-14 04:08:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 264 states have (on average 1.7727272727272727) internal successors, (468), 452 states have internal predecessors, (468), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 04:08:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 475 transitions. [2024-11-14 04:08:06,403 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 475 transitions. Word has length 59 [2024-11-14 04:08:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:08:06,403 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 475 transitions. [2024-11-14 04:08:06,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 18 states have internal predecessors, (101), 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 04:08:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 475 transitions. [2024-11-14 04:08:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-14 04:08:06,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:08:06,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:08:06,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:08:06,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 04:08:06,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:08:06,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:08:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash -637794224, now seen corresponding path program 1 times [2024-11-14 04:08:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:08:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081808876] [2024-11-14 04:08:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:08:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:08,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:08:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081808876] [2024-11-14 04:08:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081808876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551158557] [2024-11-14 04:08:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:08:08,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:08:08,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:08:08,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:08:08,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:08:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:08:08,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:08:08,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:08:08,503 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 04:08:08,857 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 04:08:08,906 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:08:08,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 04:08:09,021 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 04:08:09,039 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 19 treesize of output 1 [2024-11-14 04:08:09,297 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 22 treesize of output 10 [2024-11-14 04:08:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 treesize of output 3 [2024-11-14 04:08:09,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:08:09,642 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 04:08:09,664 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 30 treesize of output 13 [2024-11-14 04:08:09,790 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 31 treesize of output 13 [2024-11-14 04:08:09,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9 treesize of output 3 [2024-11-14 04:08:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:08:09,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:08:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551158557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:08:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206341695] [2024-11-14 04:08:10,388 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2024-11-14 04:08:10,388 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:08:10,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:08:10,389 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:08:10,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:08:16,238 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 04:08:19,042 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:11:15,394 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14764#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (or (< (+ 16 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_302| (store |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= |v_#memory_$Pointer$.offset_304| (store |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#Ultimate.C_memset_#t~loopctr160_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_30|))) (exists ((|v_#memory_int_348| (Array Int (Array Int Int))) (|v_#memory_int_353| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_352| (Array Int (Array Int Int))) (|v_#memory_int_350| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_350|) (= (store |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_6|) (= (store |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_353|) (= (store |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_352|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_308| (Array Int (Array Int Int))) (|v_#length_471| (Array Int Int)) (|v_#memory_$Pointer$.base_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_305| (Array Int (Array Int Int))) (|v_#valid_485| (Array Int Int))) (and (= (store |v_#valid_485| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_308|) (<= 40 (select |v_#length_471| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#length_471| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_306|) (= (select |v_#valid_485| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (select |v_#valid_485| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8))))))) (and (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_302| (store |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_301| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (= |v_#memory_$Pointer$.offset_304| (store |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_302| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#Ultimate.C_memset_#t~loopctr160_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr160_30| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_30|))) (exists ((|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_348| (Array Int (Array Int Int))) (|v_#memory_int_353| (Array Int (Array Int Int))) (|v_#memory_int_352| (Array Int (Array Int Int))) (|v_#memory_int_350| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_348| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_350|) (= (store |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_353|) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_353| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_350| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_352| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_352|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_308| (Array Int (Array Int Int))) (|v_#length_471| (Array Int Int)) (|v_#memory_$Pointer$.base_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_305| (Array Int (Array Int Int))) (|v_#valid_485| (Array Int Int))) (and (= (store |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_308|) (<= 40 (select |v_#length_471| |ULTIMATE.start_main_~user~0#1.base|)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#valid_485| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_306|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_308| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (select |v_#valid_485| |ULTIMATE.start_main_~user~0#1.base|) 1) (= |#length| (store |v_#length_471| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (= (select |v_#valid_485| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0))))))' at error location [2024-11-14 04:11:15,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:11:15,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:11:15,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-14 04:11:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229479183] [2024-11-14 04:11:15,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 04:11:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 04:11:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:11:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 04:11:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2416, Unknown=104, NotChecked=0, Total=2756 [2024-11-14 04:11:15,399 INFO L87 Difference]: Start difference. First operand 459 states and 475 transitions. Second operand has 18 states, 15 states have (on average 6.733333333333333) internal successors, (101), 18 states have internal predecessors, (101), 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 04:11:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:11:31,437 INFO L93 Difference]: Finished difference Result 460 states and 478 transitions. [2024-11-14 04:11:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:11:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 6.733333333333333) internal successors, (101), 18 states have internal predecessors, (101), 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 59 [2024-11-14 04:11:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:11:31,440 INFO L225 Difference]: With dead ends: 460 [2024-11-14 04:11:31,440 INFO L226 Difference]: Without dead ends: 460 [2024-11-14 04:11:31,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 178.6s TimeCoverageRelationStatistics Valid=275, Invalid=2806, Unknown=111, NotChecked=0, Total=3192 [2024-11-14 04:11:31,442 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 347 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:11:31,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1241 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2024-11-14 04:11:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-14 04:11:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 453. [2024-11-14 04:11:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 260 states have (on average 1.7769230769230768) internal successors, (462), 447 states have internal predecessors, (462), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 04:11:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 468 transitions. [2024-11-14 04:11:31,458 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 468 transitions. Word has length 59 [2024-11-14 04:11:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:11:31,460 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 468 transitions. [2024-11-14 04:11:31,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 6.733333333333333) internal successors, (101), 18 states have internal predecessors, (101), 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 04:11:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 468 transitions. [2024-11-14 04:11:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 04:11:31,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:11:31,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:11:31,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:11:31,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:11:31,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:11:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:11:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash -681708399, now seen corresponding path program 1 times [2024-11-14 04:11:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:11:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385950393] [2024-11-14 04:11:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:11:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:33,416 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 04:11:33,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:11:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385950393] [2024-11-14 04:11:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385950393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:11:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:11:33,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 04:11:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332768822] [2024-11-14 04:11:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:11:33,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:11:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:11:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:11:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:11:33,421 INFO L87 Difference]: Start difference. First operand 453 states and 468 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 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 04:11:35,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:11:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:11:49,297 INFO L93 Difference]: Finished difference Result 463 states and 481 transitions. [2024-11-14 04:11:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:11:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 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 60 [2024-11-14 04:11:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:11:49,302 INFO L225 Difference]: With dead ends: 463 [2024-11-14 04:11:49,303 INFO L226 Difference]: Without dead ends: 463 [2024-11-14 04:11:49,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-14 04:11:49,304 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 354 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:11:49,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1906 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2024-11-14 04:11:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-14 04:11:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2024-11-14 04:11:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 266 states have (on average 1.7669172932330828) internal successors, (470), 453 states have internal predecessors, (470), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 04:11:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 477 transitions. [2024-11-14 04:11:49,322 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 477 transitions. Word has length 60 [2024-11-14 04:11:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:11:49,322 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 477 transitions. [2024-11-14 04:11:49,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 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 04:11:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 477 transitions. [2024-11-14 04:11:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 04:11:49,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:11:49,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:11:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 04:11:49,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:11:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:11:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -681708398, now seen corresponding path program 1 times [2024-11-14 04:11:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:11:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532880963] [2024-11-14 04:11:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:11:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:11:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:11:51,075 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 04:11:51,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:11:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532880963] [2024-11-14 04:11:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532880963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:11:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:11:51,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 04:11:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480218353] [2024-11-14 04:11:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:11:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:11:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:11:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:11:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:11:51,077 INFO L87 Difference]: Start difference. First operand 460 states and 477 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 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 04:11:53,352 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 [] [2024-11-14 04:11:55,359 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 [] [2024-11-14 04:11:57,367 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 [] [2024-11-14 04:11:59,375 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 [] [2024-11-14 04:12:00,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:12:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:12:10,766 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2024-11-14 04:12:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:12:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 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 60 [2024-11-14 04:12:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:12:10,770 INFO L225 Difference]: With dead ends: 462 [2024-11-14 04:12:10,770 INFO L226 Difference]: Without dead ends: 462 [2024-11-14 04:12:10,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-14 04:12:10,771 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 370 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:12:10,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 825 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2144 Invalid, 4 Unknown, 0 Unchecked, 19.3s Time] [2024-11-14 04:12:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-14 04:12:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2024-11-14 04:12:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 266 states have (on average 1.763157894736842) internal successors, (469), 453 states have internal predecessors, (469), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 04:12:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 476 transitions. [2024-11-14 04:12:10,787 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 476 transitions. Word has length 60 [2024-11-14 04:12:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:12:10,787 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 476 transitions. [2024-11-14 04:12:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 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 04:12:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 476 transitions. [2024-11-14 04:12:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 04:12:10,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:12:10,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:12:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 04:12:10,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-14 04:12:10,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:12:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1260780478, now seen corresponding path program 1 times [2024-11-14 04:12:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:12:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236346356] [2024-11-14 04:12:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:12:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:12:12,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:12:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236346356] [2024-11-14 04:12:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236346356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:12:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456582131] [2024-11-14 04:12:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:12:12,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:12:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:12:12,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:12:12,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e79b630-1a63-46b5-b1f9-e8b9020fadcc/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:12:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:12:12,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 04:12:12,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:12:12,827 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 04:12:13,463 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 04:12:13,463 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 04:12:13,637 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 19 treesize of output 1 [2024-11-14 04:12:14,037 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 22 treesize of output 10 [2024-11-14 04:12:14,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:12:14,565 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 04:12:14,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:12:14,904 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-14 04:12:14,941 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 31 treesize of output 13 [2024-11-14 04:12:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:12:15,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:12:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456582131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:12:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1965674032] [2024-11-14 04:12:15,794 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-14 04:12:15,795 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:12:15,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:12:15,795 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:12:15,795 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:12:21,907 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 126 for LOIs [2024-11-14 04:12:22,324 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:15:22,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1965674032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:15:22,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 04:15:22,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [14, 9] total 54 [2024-11-14 04:15:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163257403] [2024-11-14 04:15:22,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:15:22,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 04:15:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:15:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 04:15:22,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2902, Unknown=134, NotChecked=0, Total=3306 [2024-11-14 04:15:22,859 INFO L87 Difference]: Start difference. First operand 460 states and 476 transitions. Second operand has 35 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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 04:15:25,561 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 04:15:27,795 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 04:15:30,114 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 04:15:32,139 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 04:15:34,150 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 04:15:36,433 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 04:15:38,839 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 04:15:41,112 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 04:15:43,369 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 04:15:45,385 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 04:15:47,602 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 04:15:49,784 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 04:15:51,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:15:54,033 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 04:15:56,043 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 04:15:58,052 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 04:16:00,197 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 04:16:02,463 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 04:16:04,487 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 04:16:06,494 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 04:16:08,842 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 04:16:11,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 04:16:13,183 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 04:16:15,414 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 04:16:17,724 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 04:16:19,731 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 04:16:21,750 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 04:16:23,924 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 04:16:26,215 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 04:16:28,566 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 04:16:30,916 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 04:16:32,940 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 04:16:35,195 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 04:16:37,567 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 04:16:39,856 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 04:16:42,247 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 04:16:44,494 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 04:16:46,866 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 04:16:48,889 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 04:16:51,167 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 04:16:53,552 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 04:16:55,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:16:57,842 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 04:17:00,175 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 04:17:02,431 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 04:17:04,721 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 04:17:06,743 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 04:17:09,051 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 04:17:11,334 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 04:17:13,350 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 04:17:15,357 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 04:17:17,675 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 04:17:19,884 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 04:17:21,956 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 04:17:24,166 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 04:17:26,470 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 04:17:28,480 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 04:17:30,496 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 04:17:32,797 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 04:17:35,081 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 04:17:37,183 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 04:17:39,432 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 04:17:41,830 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 04:17:43,836 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 04:17:46,152 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 04:17:48,483 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 04:17:50,504 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 04:17:52,768 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 04:17:55,108 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 04:17:57,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]