./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue-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_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/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_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/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_7a414c7e-afe1-4ada-9e25-aea9590d768a/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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:08:40,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:08:40,385 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:08:40,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:08:40,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:08:40,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:08:40,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:08:40,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:08:40,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:08:40,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:08:40,432 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:08:40,433 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:08:40,433 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:08:40,433 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:08:40,434 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:08:40,434 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:08:40,434 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:08:40,434 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:08:40,435 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:08:40,435 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:08:40,435 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:08:40,435 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:08:40,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:08:40,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:08:40,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:08:40,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:08:40,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:08:40,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:08:40,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:08:40,438 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:08:40,438 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:08:40,438 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:08:40,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:08:40,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:08:40,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:08:40,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:08:40,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:08:40,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:08:40,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:08:40,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:08:40,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:08:40,440 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:08:40,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:08:40,441 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_7a414c7e-afe1-4ada-9e25-aea9590d768a/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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2024-11-14 05:08:40,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:08:40,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:08:40,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:08:40,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:08:40,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:08:40,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-queue-1.i Unable to find full path for "g++" [2024-11-14 05:08:42,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:08:43,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:08:43,126 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-11-14 05:08:43,146 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data/d797a5b07/9d15554963064afeb24f362eb8087f55/FLAGbd472b074 [2024-11-14 05:08:43,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data/d797a5b07/9d15554963064afeb24f362eb8087f55 [2024-11-14 05:08:43,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:08:43,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:08:43,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:08:43,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:08:43,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:08:43,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84f98c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43, skipping insertion in model container [2024-11-14 05:08:43,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:08:43,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:08:43,605 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:08:43,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:08:43,737 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:08:43,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43 WrapperNode [2024-11-14 05:08:43,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:08:43,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:08:43,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:08:43,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:08:43,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,795 INFO L138 Inliner]: procedures = 119, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 210 [2024-11-14 05:08:43,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:08:43,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:08:43,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:08:43,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:08:43,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:08:43,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:08:43,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:08:43,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:08:43,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (1/1) ... [2024-11-14 05:08:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:08:43,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:08:43,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:08:43,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:08:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 05:08:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 05:08:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:08:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:08:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:08:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:08:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:08:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:08:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:08:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:08:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:08:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:08:44,048 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:08:44,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:08:44,724 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-14 05:08:44,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:08:44,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:08:44,838 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-14 05:08:44,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:08:44 BoogieIcfgContainer [2024-11-14 05:08:44,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:08:44,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:08:44,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:08:44,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:08:44,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:08:43" (1/3) ... [2024-11-14 05:08:44,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b583e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:08:44, skipping insertion in model container [2024-11-14 05:08:44,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:43" (2/3) ... [2024-11-14 05:08:44,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b583e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:08:44, skipping insertion in model container [2024-11-14 05:08:44,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:08:44" (3/3) ... [2024-11-14 05:08:44,850 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2024-11-14 05:08:44,867 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:08:44,869 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-queue-1.i that has 2 procedures, 171 locations, 1 initial locations, 17 loop locations, and 63 error locations. [2024-11-14 05:08:44,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:08:44,946 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;@485aaae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:08:44,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-11-14 05:08:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 92 states have (on average 2.282608695652174) internal successors, (210), 155 states have internal predecessors, (210), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:08:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:08:44,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:44,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:08:44,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 15885, now seen corresponding path program 1 times [2024-11-14 05:08:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098127227] [2024-11-14 05:08:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:45,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098127227] [2024-11-14 05:08:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098127227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:08:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673112989] [2024-11-14 05:08:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:45,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:08:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:08:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:45,240 INFO L87 Difference]: Start difference. First operand has 171 states, 92 states have (on average 2.282608695652174) internal successors, (210), 155 states have internal predecessors, (210), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 05:08:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:45,553 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2024-11-14 05:08:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:08:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-14 05:08:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:45,564 INFO L225 Difference]: With dead ends: 146 [2024-11-14 05:08:45,565 INFO L226 Difference]: Without dead ends: 145 [2024-11-14 05:08:45,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:45,572 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:45,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 98 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:08:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-14 05:08:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-14 05:08:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 79 states have (on average 1.9620253164556962) internal successors, (155), 143 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2024-11-14 05:08:45,639 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 2 [2024-11-14 05:08:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:45,641 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2024-11-14 05:08:45,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 05:08:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2024-11-14 05:08:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:08:45,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:45,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:08:45,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:08:45,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:45,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash 15886, now seen corresponding path program 1 times [2024-11-14 05:08:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545726195] [2024-11-14 05:08:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:45,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545726195] [2024-11-14 05:08:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545726195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:45,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:08:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386241049] [2024-11-14 05:08:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:45,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:08:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:08:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:45,802 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 05:08:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:46,020 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2024-11-14 05:08:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:08:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-14 05:08:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:46,022 INFO L225 Difference]: With dead ends: 134 [2024-11-14 05:08:46,022 INFO L226 Difference]: Without dead ends: 134 [2024-11-14 05:08:46,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:46,025 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:46,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:08:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-14 05:08:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-14 05:08:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 132 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-11-14 05:08:46,042 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 2 [2024-11-14 05:08:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:46,042 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-11-14 05:08:46,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 05:08:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-11-14 05:08:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:08:46,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:46,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:08:46,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:46,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash -493100156, now seen corresponding path program 1 times [2024-11-14 05:08:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590888403] [2024-11-14 05:08:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:46,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590888403] [2024-11-14 05:08:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590888403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:46,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:46,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:08:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128829785] [2024-11-14 05:08:46,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:08:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:46,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:08:46,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:08:46,328 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 05:08:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:46,566 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2024-11-14 05:08:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-14 05:08:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:46,569 INFO L225 Difference]: With dead ends: 136 [2024-11-14 05:08:46,571 INFO L226 Difference]: Without dead ends: 136 [2024-11-14 05:08:46,571 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 05:08:46,572 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 212 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:46,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 103 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:08:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-14 05:08:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-11-14 05:08:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.7294117647058824) internal successors, (147), 132 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2024-11-14 05:08:46,589 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 7 [2024-11-14 05:08:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2024-11-14 05:08:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 05:08:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2024-11-14 05:08:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:08:46,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:46,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:46,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:08:46,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -493100155, now seen corresponding path program 1 times [2024-11-14 05:08:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685875551] [2024-11-14 05:08:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:46,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685875551] [2024-11-14 05:08:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685875551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:08:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552003925] [2024-11-14 05:08:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:46,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:08:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:08:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:08:46,992 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 05:08:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:47,388 INFO L93 Difference]: Finished difference Result 207 states and 248 transitions. [2024-11-14 05:08:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-14 05:08:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:47,390 INFO L225 Difference]: With dead ends: 207 [2024-11-14 05:08:47,390 INFO L226 Difference]: Without dead ends: 207 [2024-11-14 05:08:47,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:08:47,391 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 341 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:47,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 141 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:08:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-14 05:08:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 140. [2024-11-14 05:08:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.7032967032967032) internal successors, (155), 138 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2024-11-14 05:08:47,404 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 7 [2024-11-14 05:08:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:47,404 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2024-11-14 05:08:47,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 05:08:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2024-11-14 05:08:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:08:47,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:47,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:47,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:08:47,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:47,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1157449435, now seen corresponding path program 1 times [2024-11-14 05:08:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342770503] [2024-11-14 05:08:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:47,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342770503] [2024-11-14 05:08:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342770503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:08:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808288845] [2024-11-14 05:08:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:47,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:08:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:47,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:08:47,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:47,450 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:47,513 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2024-11-14 05:08:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:08:47,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 05:08:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:47,515 INFO L225 Difference]: With dead ends: 135 [2024-11-14 05:08:47,515 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 05:08:47,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:47,516 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 110 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:47,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 127 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:08:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 05:08:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-14 05:08:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.6373626373626373) internal successors, (149), 133 states have internal predecessors, (149), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2024-11-14 05:08:47,527 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 10 [2024-11-14 05:08:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:47,527 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2024-11-14 05:08:47,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2024-11-14 05:08:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:08:47,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:47,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:47,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:08:47,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1422416665, now seen corresponding path program 1 times [2024-11-14 05:08:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977062554] [2024-11-14 05:08:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:47,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977062554] [2024-11-14 05:08:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977062554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:47,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:08:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368675385] [2024-11-14 05:08:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:47,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:08:47,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:47,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:08:47,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:47,712 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 05:08:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:47,929 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2024-11-14 05:08:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:47,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-14 05:08:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:47,934 INFO L225 Difference]: With dead ends: 134 [2024-11-14 05:08:47,934 INFO L226 Difference]: Without dead ends: 134 [2024-11-14 05:08:47,934 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 05:08:47,935 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:47,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 365 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:08:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-14 05:08:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-14 05:08:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 132 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2024-11-14 05:08:47,948 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 9 [2024-11-14 05:08:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:47,948 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2024-11-14 05:08:47,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 05:08:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2024-11-14 05:08:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:08:47,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:47,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:47,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:08:47,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:47,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:47,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1422416664, now seen corresponding path program 1 times [2024-11-14 05:08:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:47,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092538557] [2024-11-14 05:08:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:48,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092538557] [2024-11-14 05:08:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092538557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:08:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369920063] [2024-11-14 05:08:48,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:48,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:08:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:08:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:48,166 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 05:08:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:48,360 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2024-11-14 05:08:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-14 05:08:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:48,361 INFO L225 Difference]: With dead ends: 133 [2024-11-14 05:08:48,361 INFO L226 Difference]: Without dead ends: 133 [2024-11-14 05:08:48,362 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 05:08:48,363 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:48,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 365 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:08:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-14 05:08:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-14 05:08:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 131 states have internal predecessors, (145), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2024-11-14 05:08:48,375 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 9 [2024-11-14 05:08:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:48,375 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2024-11-14 05:08:48,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 05:08:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2024-11-14 05:08:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:08:48,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:48,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:48,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:08:48,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1142373201, now seen corresponding path program 1 times [2024-11-14 05:08:48,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:48,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288645344] [2024-11-14 05:08:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:48,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288645344] [2024-11-14 05:08:48,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288645344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:48,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:48,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:08:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496442010] [2024-11-14 05:08:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:48,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:08:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:08:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:08:48,868 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 05:08:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:49,512 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2024-11-14 05:08:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:08:49,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 05:08:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:49,514 INFO L225 Difference]: With dead ends: 188 [2024-11-14 05:08:49,514 INFO L226 Difference]: Without dead ends: 188 [2024-11-14 05:08:49,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:08:49,516 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 274 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:49,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 391 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:08:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-14 05:08:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 120. [2024-11-14 05:08:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 118 states have internal predecessors, (131), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-14 05:08:49,526 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 11 [2024-11-14 05:08:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:49,526 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-14 05:08:49,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 05:08:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-14 05:08:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:08:49,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:49,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:08:49,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:49,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1142373202, now seen corresponding path program 1 times [2024-11-14 05:08:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:49,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608601643] [2024-11-14 05:08:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:49,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608601643] [2024-11-14 05:08:49,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608601643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:49,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:49,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:08:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809317431] [2024-11-14 05:08:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:49,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:08:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:08:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:08:49,799 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 05:08:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:50,189 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2024-11-14 05:08:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:08:50,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 05:08:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:50,191 INFO L225 Difference]: With dead ends: 120 [2024-11-14 05:08:50,191 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 05:08:50,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:08:50,192 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 191 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:50,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 346 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:08:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 05:08:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-14 05:08:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 117 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2024-11-14 05:08:50,199 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 11 [2024-11-14 05:08:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:50,199 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2024-11-14 05:08:50,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 05:08:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2024-11-14 05:08:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:08:50,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:50,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:50,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:08:50,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:50,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash 719432501, now seen corresponding path program 1 times [2024-11-14 05:08:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692793085] [2024-11-14 05:08:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:50,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:50,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692793085] [2024-11-14 05:08:50,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692793085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:50,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:50,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:08:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775691393] [2024-11-14 05:08:50,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:50,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:08:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:08:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:08:50,249 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:50,315 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2024-11-14 05:08:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:08:50,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 05:08:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:50,316 INFO L225 Difference]: With dead ends: 166 [2024-11-14 05:08:50,316 INFO L226 Difference]: Without dead ends: 166 [2024-11-14 05:08:50,316 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 05:08:50,317 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:50,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 210 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:08:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-14 05:08:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 132. [2024-11-14 05:08:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.469387755102041) internal successors, (144), 130 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2024-11-14 05:08:50,321 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 16 [2024-11-14 05:08:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2024-11-14 05:08:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2024-11-14 05:08:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:08:50,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:50,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:08:50,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1590044248, now seen corresponding path program 1 times [2024-11-14 05:08:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056477581] [2024-11-14 05:08:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:50,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056477581] [2024-11-14 05:08:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056477581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:08:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438026727] [2024-11-14 05:08:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:50,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:08:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:08:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:50,611 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 05:08:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:50,764 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-11-14 05:08:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:08:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-14 05:08:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:50,765 INFO L225 Difference]: With dead ends: 137 [2024-11-14 05:08:50,765 INFO L226 Difference]: Without dead ends: 137 [2024-11-14 05:08:50,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:08:50,766 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:50,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 405 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:08:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-14 05:08:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-14 05:08:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 133 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2024-11-14 05:08:50,775 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 17 [2024-11-14 05:08:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:50,775 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2024-11-14 05:08:50,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 05:08:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2024-11-14 05:08:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:08:50,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:50,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:50,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:08:50,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:50,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2046126651, now seen corresponding path program 1 times [2024-11-14 05:08:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731295539] [2024-11-14 05:08:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:50,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731295539] [2024-11-14 05:08:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731295539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:08:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143592441] [2024-11-14 05:08:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:08:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:08:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:50,858 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 05:08:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:50,985 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2024-11-14 05:08:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-14 05:08:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:50,986 INFO L225 Difference]: With dead ends: 135 [2024-11-14 05:08:50,986 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 05:08:50,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:08:50,987 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:50,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 177 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:08:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 05:08:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-14 05:08:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 133 states have internal predecessors, (146), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2024-11-14 05:08:50,993 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 18 [2024-11-14 05:08:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2024-11-14 05:08:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 05:08:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2024-11-14 05:08:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:08:50,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:50,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:08:50,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:08:50,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:50,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1147000909, now seen corresponding path program 1 times [2024-11-14 05:08:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086375277] [2024-11-14 05:08:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:08:51,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086375277] [2024-11-14 05:08:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086375277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:51,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:08:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:08:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066945436] [2024-11-14 05:08:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:08:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:08:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:08:51,169 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:08:51,342 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2024-11-14 05:08:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:08:51,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 05:08:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:08:51,344 INFO L225 Difference]: With dead ends: 135 [2024-11-14 05:08:51,344 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 05:08:51,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:08:51,345 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 291 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:08:51,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 179 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:08:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 05:08:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-14 05:08:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 132 states have internal predecessors, (145), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2024-11-14 05:08:51,353 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 19 [2024-11-14 05:08:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:08:51,353 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2024-11-14 05:08:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:08:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2024-11-14 05:08:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:08:51,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:08:51,357 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] [2024-11-14 05:08:51,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:08:51,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:08:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:08:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1983658504, now seen corresponding path program 1 times [2024-11-14 05:08:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:08:51,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467967459] [2024-11-14 05:08:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:08:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:51,485 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 05:08:51,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:08:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467967459] [2024-11-14 05:08:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467967459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:08:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140259975] [2024-11-14 05:08:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:08:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:08:51,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:08:51,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:08:51,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:08:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:51,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:08:51,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:51,699 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 13 treesize of output 9 [2024-11-14 05:08:51,746 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 05:08:51,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:08:51,803 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 05:08:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140259975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:08:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2018861642] [2024-11-14 05:08:51,826 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 05:08:51,827 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:08:51,830 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:08:51,835 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:08:51,836 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:08:53,435 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:08:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2018861642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:08:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:08:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [3, 3, 3] total 15 [2024-11-14 05:08:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28845088] [2024-11-14 05:08:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:08:58,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:08:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:08:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:08:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=205, Unknown=1, NotChecked=0, Total=272 [2024-11-14 05:08:58,770 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 05:09:02,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:09:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:05,489 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2024-11-14 05:09:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:09:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 21 [2024-11-14 05:09:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:05,491 INFO L225 Difference]: With dead ends: 145 [2024-11-14 05:09:05,491 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 05:09:05,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=66, Invalid=205, Unknown=1, NotChecked=0, Total=272 [2024-11-14 05:09:05,492 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:05,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 407 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 489 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2024-11-14 05:09:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 05:09:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-14 05:09:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 124 states have internal predecessors, (136), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-14 05:09:05,497 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 21 [2024-11-14 05:09:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:05,498 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-14 05:09:05,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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 05:09:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-14 05:09:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:09:05,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:05,499 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 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 05:09:05,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:09:05,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 05:09:05,703 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:09:05,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1128338728, now seen corresponding path program 1 times [2024-11-14 05:09:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:05,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799485400] [2024-11-14 05:09:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:06,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799485400] [2024-11-14 05:09:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799485400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041501190] [2024-11-14 05:09:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:06,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:06,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:06,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:09:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:06,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:09:06,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:06,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:09:06,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:09:06,367 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 05:09:06,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:09:06,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:09:06,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:09:06,536 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 41 treesize of output 38 [2024-11-14 05:09:06,542 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 24 treesize of output 11 [2024-11-14 05:09:06,566 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 15 treesize of output 7 [2024-11-14 05:09:06,622 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:09:06,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 05:09:06,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:09:06,767 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 24 treesize of output 12 [2024-11-14 05:09:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:06,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:07,094 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_439 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_441 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_438))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_441)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) (or (forall ((v_ArrVal_439 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_441 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_438))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store .cse1 .cse2 v_ArrVal_441) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (= .cse2 0))))))) is different from false [2024-11-14 05:09:07,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,317 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2024-11-14 05:09:07,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 145 [2024-11-14 05:09:07,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,369 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 86 treesize of output 82 [2024-11-14 05:09:07,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-14 05:09:07,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,513 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 05:09:07,519 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 30 treesize of output 22 [2024-11-14 05:09:07,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 05:09:07,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,544 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-14 05:09:07,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 220 [2024-11-14 05:09:07,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,589 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 142 treesize of output 141 [2024-11-14 05:09:07,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 126 [2024-11-14 05:09:07,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:07,702 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 05:09:07,709 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 30 treesize of output 22 [2024-11-14 05:09:07,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:09:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:07,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041501190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:07,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407177740] [2024-11-14 05:09:07,953 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 05:09:07,953 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:07,953 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:07,954 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:07,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:09,075 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 25 for LOIs [2024-11-14 05:09:09,081 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:09:39,649 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4518#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) 0) 0) (not (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| 0)) (<= 4 (select |#length| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) 0) 0))))' at error location [2024-11-14 05:09:39,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:09:39,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:09:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 25 [2024-11-14 05:09:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782092712] [2024-11-14 05:09:39,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:09:39,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:09:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:39,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:09:39,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1608, Unknown=22, NotChecked=82, Total=1892 [2024-11-14 05:09:39,652 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:42,068 INFO L93 Difference]: Finished difference Result 297 states and 350 transitions. [2024-11-14 05:09:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:09:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-14 05:09:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:42,070 INFO L225 Difference]: With dead ends: 297 [2024-11-14 05:09:42,070 INFO L226 Difference]: Without dead ends: 297 [2024-11-14 05:09:42,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=310, Invalid=2532, Unknown=24, NotChecked=104, Total=2970 [2024-11-14 05:09:42,074 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 810 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 29 mSolverCounterUnsat, 104 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 104 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:42,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1485 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1326 Invalid, 104 Unknown, 320 Unchecked, 1.8s Time] [2024-11-14 05:09:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-14 05:09:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 140. [2024-11-14 05:09:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 138 states have internal predecessors, (152), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2024-11-14 05:09:42,084 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 29 [2024-11-14 05:09:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:42,085 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2024-11-14 05:09:42,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2024-11-14 05:09:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:09:42,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:42,086 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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 05:09:42,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:09:42,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 05:09:42,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:09:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1452233723, now seen corresponding path program 1 times [2024-11-14 05:09:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291200826] [2024-11-14 05:09:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:42,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:42,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291200826] [2024-11-14 05:09:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291200826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:42,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:09:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:09:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816063433] [2024-11-14 05:09:42,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:42,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:09:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:09:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:09:42,351 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:42,438 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2024-11-14 05:09:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:09:42,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 05:09:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:42,440 INFO L225 Difference]: With dead ends: 192 [2024-11-14 05:09:42,440 INFO L226 Difference]: Without dead ends: 192 [2024-11-14 05:09:42,440 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 05:09:42,441 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:42,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 203 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:09:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-14 05:09:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 158. [2024-11-14 05:09:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.36) internal successors, (170), 156 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2024-11-14 05:09:42,453 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 30 [2024-11-14 05:09:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:42,453 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2024-11-14 05:09:42,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:09:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2024-11-14 05:09:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:09:42,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:42,454 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:09:42,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:09:42,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:09:42,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1571903295, now seen corresponding path program 1 times [2024-11-14 05:09:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963936423] [2024-11-14 05:09:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:42,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963936423] [2024-11-14 05:09:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963936423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:42,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097998948] [2024-11-14 05:09:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:42,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:42,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:42,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:42,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:09:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:43,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:09:43,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:43,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:09:43,087 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:09:43,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:09:43,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:09:43,239 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:09:43,239 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 34 treesize of output 33 [2024-11-14 05:09:43,300 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:09:43,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:09:43,335 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:09:43,335 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 34 treesize of output 33 [2024-11-14 05:09:43,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:09:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:43,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:43,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-14 05:09:43,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_585) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-14 05:09:43,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_583 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_583))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_585)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-14 05:09:43,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_583 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_583))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_585)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-14 05:09:43,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:43,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-14 05:09:43,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:43,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2024-11-14 05:09:43,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2024-11-14 05:09:43,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:09:43,666 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 76 treesize of output 74 [2024-11-14 05:09:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:44,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097998948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648559733] [2024-11-14 05:09:44,878 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-14 05:09:44,878 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:44,878 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:44,879 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:44,879 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:45,933 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:10:15,641 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5579#(and (or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 0) 0))) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~status~0#1| 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 0)) 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 0) |ULTIMATE.start_main_~item~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_#t~nondet21#1_13| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet21#1_13| 0)) (<= |v_ULTIMATE.start_main_#t~nondet21#1_13| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet21#1_13| 2147483648)))))' at error location [2024-11-14 05:10:15,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:10:15,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:10:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 25 [2024-11-14 05:10:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118865421] [2024-11-14 05:10:15,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:10:15,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 05:10:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 05:10:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1564, Unknown=11, NotChecked=340, Total=2162 [2024-11-14 05:10:15,644 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 states have internal predecessors, (101), 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 05:10:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:10:17,000 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2024-11-14 05:10:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:10:17,001 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 states have internal predecessors, (101), 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 35 [2024-11-14 05:10:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:10:17,003 INFO L225 Difference]: With dead ends: 273 [2024-11-14 05:10:17,003 INFO L226 Difference]: Without dead ends: 273 [2024-11-14 05:10:17,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=351, Invalid=2104, Unknown=11, NotChecked=396, Total=2862 [2024-11-14 05:10:17,005 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 748 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1144 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:10:17,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 587 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 667 Invalid, 0 Unknown, 1144 Unchecked, 1.0s Time] [2024-11-14 05:10:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-14 05:10:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 167. [2024-11-14 05:10:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 165 states have internal predecessors, (182), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:10:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2024-11-14 05:10:17,014 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 35 [2024-11-14 05:10:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:10:17,014 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2024-11-14 05:10:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 states have internal predecessors, (101), 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 05:10:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2024-11-14 05:10:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:10:17,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:10:17,016 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:17,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:10:17,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 05:10:17,217 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:10:17,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:10:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1571903296, now seen corresponding path program 1 times [2024-11-14 05:10:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:10:17,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251589662] [2024-11-14 05:10:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:10:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:10:17,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:10:17,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251589662] [2024-11-14 05:10:17,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251589662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:10:17,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102206814] [2024-11-14 05:10:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:17,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:10:17,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:10:17,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:10:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:18,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:10:18,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:10:18,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:10:18,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:10:18,125 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:10:18,125 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 05:10:18,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:10:18,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:10:18,266 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:10:18,266 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 50 treesize of output 45 [2024-11-14 05:10:18,273 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 24 treesize of output 11 [2024-11-14 05:10:18,359 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:10:18,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:10:18,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:18,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:10:18,418 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:10:18,418 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 50 treesize of output 45 [2024-11-14 05:10:18,431 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 24 treesize of output 11 [2024-11-14 05:10:18,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:10:18,648 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 7 treesize of output 3 [2024-11-14 05:10:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:10:18,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:10:19,014 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_682))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_683) .cse0 v_ArrVal_687) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_686) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_683) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_687) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2024-11-14 05:10:19,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_682))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_683) .cse1 v_ArrVal_687) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_686) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_683) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_682) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_687) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2024-11-14 05:10:19,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,050 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-14 05:10:19,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,059 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 05:10:19,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 301 [2024-11-14 05:10:19,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 826 treesize of output 793 [2024-11-14 05:10:19,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 172 [2024-11-14 05:10:19,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 164 [2024-11-14 05:10:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2024-11-14 05:10:19,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,167 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 160 treesize of output 150 [2024-11-14 05:10:19,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,419 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-14 05:10:19,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:19,430 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-14 05:10:19,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:10:19,438 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 28 treesize of output 20 [2024-11-14 05:10:19,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:10:19,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 05:10:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:10:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102206814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:10:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1357920192] [2024-11-14 05:10:19,623 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-14 05:10:19,623 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:10:19,624 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:10:19,624 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:10:19,624 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:10:20,570 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:10:50,597 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6287#(and (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~status~0#1| 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 0) 0))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 0) 8) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 0) 12))) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_#t~nondet21#1_13| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet21#1_13| 0)) (<= |v_ULTIMATE.start_main_#t~nondet21#1_13| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet21#1_13| 2147483648)))))' at error location [2024-11-14 05:10:50,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:10:50,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:10:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2024-11-14 05:10:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80380014] [2024-11-14 05:10:50,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:10:50,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:10:50,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:10:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1610, Unknown=21, NotChecked=166, Total=1980 [2024-11-14 05:10:50,602 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 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 05:10:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:10:52,349 INFO L93 Difference]: Finished difference Result 266 states and 305 transitions. [2024-11-14 05:10:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:10:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 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 35 [2024-11-14 05:10:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:10:52,351 INFO L225 Difference]: With dead ends: 266 [2024-11-14 05:10:52,351 INFO L226 Difference]: Without dead ends: 266 [2024-11-14 05:10:52,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=353, Invalid=2709, Unknown=26, NotChecked=218, Total=3306 [2024-11-14 05:10:52,352 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 705 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:10:52,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 839 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1179 Invalid, 0 Unknown, 540 Unchecked, 1.1s Time] [2024-11-14 05:10:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-14 05:10:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 170. [2024-11-14 05:10:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 168 states have internal predecessors, (185), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:10:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2024-11-14 05:10:52,358 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 35 [2024-11-14 05:10:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:10:52,359 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2024-11-14 05:10:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 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 05:10:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2024-11-14 05:10:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:10:52,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:10:52,360 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:52,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:10:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:10:52,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:10:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:10:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 541416560, now seen corresponding path program 1 times [2024-11-14 05:10:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:10:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914470058] [2024-11-14 05:10:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:10:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:10:52,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:10:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914470058] [2024-11-14 05:10:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914470058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:10:52,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:10:52,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:10:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480286231] [2024-11-14 05:10:52,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:10:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:10:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:10:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:10:52,614 INFO L87 Difference]: Start difference. First operand 170 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:10:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:10:52,663 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2024-11-14 05:10:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:10:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-14 05:10:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:10:52,664 INFO L225 Difference]: With dead ends: 171 [2024-11-14 05:10:52,664 INFO L226 Difference]: Without dead ends: 171 [2024-11-14 05:10:52,664 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 05:10:52,665 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:10:52,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:10:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-14 05:10:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-14 05:10:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 169 states have internal predecessors, (185), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:10:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2024-11-14 05:10:52,672 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 38 [2024-11-14 05:10:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:10:52,673 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2024-11-14 05:10:52,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:10:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2024-11-14 05:10:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:10:52,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:10:52,674 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:10:52,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:10:52,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:10:52,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:10:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash -267406724, now seen corresponding path program 1 times [2024-11-14 05:10:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:10:52,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722142206] [2024-11-14 05:10:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:10:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:10:53,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:10:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722142206] [2024-11-14 05:10:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722142206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:10:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572714173] [2024-11-14 05:10:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:53,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:53,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:10:53,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:10:53,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:10:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:53,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 05:10:53,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:10:53,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:10:53,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:10:53,807 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 05:10:53,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:10:53,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:10:53,971 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:10:53,972 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 41 treesize of output 38 [2024-11-14 05:10:53,979 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 24 treesize of output 11 [2024-11-14 05:10:54,051 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:10:54,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 05:10:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:54,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:10:54,134 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:10:54,135 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 60 treesize of output 53 [2024-11-14 05:10:54,141 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 24 treesize of output 11 [2024-11-14 05:10:54,148 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 11 [2024-11-14 05:10:54,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:10:54,316 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 7 treesize of output 3 [2024-11-14 05:10:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:10:54,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:10:54,437 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 69 treesize of output 49 [2024-11-14 05:10:54,446 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_835 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_836 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_836) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 05:10:54,600 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_830))) (or (forall ((v_ArrVal_836 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_836) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (< (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (or (forall ((v_ArrVal_830 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_831))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_835) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_830))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (forall ((v_ArrVal_836 (Array Int Int))) (< .cse3 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_836) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))) (< .cse3 0)))))) is different from false [2024-11-14 05:10:54,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_830))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((v_ArrVal_836 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_831) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_836) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_830))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (< .cse2 0) (forall ((v_ArrVal_836 (Array Int Int))) (< .cse2 (+ (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_831) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_836) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1))))))) (or (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_831))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store .cse4 .cse5 v_ArrVal_835) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse5)))) (forall ((v_ArrVal_830 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_830) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) is different from false [2024-11-14 05:10:54,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:54,655 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2024-11-14 05:10:54,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:54,664 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-14 05:10:54,672 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 50 treesize of output 42 [2024-11-14 05:10:54,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:54,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 116 [2024-11-14 05:10:54,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-14 05:10:54,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2024-11-14 05:10:54,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:54,732 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 60 treesize of output 64 [2024-11-14 05:10:54,853 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:10:54,853 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2024-11-14 05:10:54,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:10:54,859 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 05:10:54,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:10:54,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:10:54,876 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:10:54,876 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-14 05:10:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:10:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572714173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:10:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237448886] [2024-11-14 05:10:54,999 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2024-11-14 05:10:54,999 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:10:54,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:10:54,999 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:10:54,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:10:55,740 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 51 for LOIs [2024-11-14 05:10:55,748 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:11:24,256 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7377#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ 12 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0)) 1) (= (select |#valid| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 1) (<= 0 (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))) (<= 4 (select |#length| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|)) (not (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2| 0)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0) 0))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))) 0))) (exists ((|v_ULTIMATE.start_main_#t~nondet21#1_13| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet21#1_13| 0)) (<= |v_ULTIMATE.start_main_#t~nondet21#1_13| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet21#1_13| 2147483648)))))' at error location [2024-11-14 05:11:24,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:11:24,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:11:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 33 [2024-11-14 05:11:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483665871] [2024-11-14 05:11:24,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:11:24,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 05:11:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:11:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 05:11:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2509, Unknown=10, NotChecked=312, Total=3080 [2024-11-14 05:11:24,258 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand has 34 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 33 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:11:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:11:26,024 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2024-11-14 05:11:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:11:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 33 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-14 05:11:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:11:26,026 INFO L225 Difference]: With dead ends: 272 [2024-11-14 05:11:26,026 INFO L226 Difference]: Without dead ends: 272 [2024-11-14 05:11:26,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=422, Invalid=3740, Unknown=10, NotChecked=384, Total=4556 [2024-11-14 05:11:26,028 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1136 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 779 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:11:26,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1080 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1105 Invalid, 0 Unknown, 779 Unchecked, 0.9s Time] [2024-11-14 05:11:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-14 05:11:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 170. [2024-11-14 05:11:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:11:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2024-11-14 05:11:26,034 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 39 [2024-11-14 05:11:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:11:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2024-11-14 05:11:26,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 33 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:11:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2024-11-14 05:11:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:11:26,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:11:26,036 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:11:26,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:11:26,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:11:26,236 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:11:26,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:11:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1194942609, now seen corresponding path program 1 times [2024-11-14 05:11:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:11:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291322583] [2024-11-14 05:11:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:11:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:11:26,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:11:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291322583] [2024-11-14 05:11:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291322583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251460489] [2024-11-14 05:11:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:26,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:11:26,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:11:26,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:11:26,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:11:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:26,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:11:26,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:11:26,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-14 05:11:26,560 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 21 treesize of output 13 [2024-11-14 05:11:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:11:26,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:11:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:11:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251460489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:11:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [295720927] [2024-11-14 05:11:26,665 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2024-11-14 05:11:26,667 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:11:26,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:11:26,667 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:11:26,667 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:11:27,618 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:11:54,211 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8101#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~status~0#1| 1) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:11:54,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:11:54,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:11:54,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-14 05:11:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760496584] [2024-11-14 05:11:54,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:11:54,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:11:54,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:11:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:11:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=685, Unknown=9, NotChecked=0, Total=812 [2024-11-14 05:11:54,212 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 05:11:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:11:54,383 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2024-11-14 05:11:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:11:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 39 [2024-11-14 05:11:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:11:54,384 INFO L225 Difference]: With dead ends: 193 [2024-11-14 05:11:54,384 INFO L226 Difference]: Without dead ends: 193 [2024-11-14 05:11:54,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=132, Invalid=789, Unknown=9, NotChecked=0, Total=930 [2024-11-14 05:11:54,385 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 136 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:11:54,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 291 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:11:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-14 05:11:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2024-11-14 05:11:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 186 states have internal predecessors, (209), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:11:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2024-11-14 05:11:54,391 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 39 [2024-11-14 05:11:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:11:54,391 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2024-11-14 05:11:54,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 05:11:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2024-11-14 05:11:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:11:54,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:11:54,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:11:54,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:11:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:11:54,596 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:11:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:11:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1194944576, now seen corresponding path program 1 times [2024-11-14 05:11:54,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:11:54,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929889220] [2024-11-14 05:11:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:11:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:11:55,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:11:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929889220] [2024-11-14 05:11:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929889220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:55,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758588515] [2024-11-14 05:11:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:55,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:11:55,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:11:55,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:11:55,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:11:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:55,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:11:55,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:11:55,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:11:55,295 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:11:55,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:11:55,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:11:55,423 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:11:55,424 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 34 treesize of output 33 [2024-11-14 05:11:55,475 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:11:55,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:11:55,504 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:11:55,504 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 34 treesize of output 33 [2024-11-14 05:11:55,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:11:55,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-14 05:11:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:11:55,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:11:55,949 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1028))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1030)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1028))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1030)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2024-11-14 05:11:55,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1028))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1030)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1028))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1030)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-14 05:11:55,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:11:55,969 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-14 05:11:55,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:11:55,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2024-11-14 05:11:55,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 163 [2024-11-14 05:11:55,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:11:55,998 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 163 treesize of output 159 [2024-11-14 05:11:56,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:11:56,292 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-14 05:11:56,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:11:56,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2024-11-14 05:11:56,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2024-11-14 05:11:56,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:11:56,318 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 72 treesize of output 71 [2024-11-14 05:11:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:11:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758588515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:11:56,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2131351243] [2024-11-14 05:11:56,469 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-14 05:11:56,470 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:11:56,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:11:56,470 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:11:56,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:11:57,306 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:12:30,831 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8762#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~head~0#1.base_88| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~head~0#1.base_88|) 1))) (= |ULTIMATE.start_main_~status~0#1| 1))' at error location [2024-11-14 05:12:30,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:12:30,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:12:30,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 24 [2024-11-14 05:12:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070060544] [2024-11-14 05:12:30,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:12:30,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:12:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:12:30,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:12:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1807, Unknown=27, NotChecked=178, Total=2256 [2024-11-14 05:12:30,834 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 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 05:12:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:12:31,495 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2024-11-14 05:12:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:12:31,498 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 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 39 [2024-11-14 05:12:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:12:31,499 INFO L225 Difference]: With dead ends: 217 [2024-11-14 05:12:31,499 INFO L226 Difference]: Without dead ends: 217 [2024-11-14 05:12:31,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=244, Invalid=1807, Unknown=27, NotChecked=178, Total=2256 [2024-11-14 05:12:31,501 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 204 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:12:31,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 694 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 765 Invalid, 0 Unknown, 380 Unchecked, 0.6s Time] [2024-11-14 05:12:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-14 05:12:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2024-11-14 05:12:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 173 states have (on average 1.3641618497109826) internal successors, (236), 204 states have internal predecessors, (236), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:12:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 244 transitions. [2024-11-14 05:12:31,507 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 244 transitions. Word has length 39 [2024-11-14 05:12:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:12:31,507 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 244 transitions. [2024-11-14 05:12:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 25 states have internal predecessors, (86), 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 05:12:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 244 transitions. [2024-11-14 05:12:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:12:31,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:12:31,509 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:12:31,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:12:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-14 05:12:31,709 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:12:31,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:12:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1194944575, now seen corresponding path program 1 times [2024-11-14 05:12:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:12:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075803294] [2024-11-14 05:12:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:12:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:12:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:12:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:12:32,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:12:32,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075803294] [2024-11-14 05:12:32,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075803294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:12:32,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817765512] [2024-11-14 05:12:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:12:32,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:12:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:12:32,236 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:12:32,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:12:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:12:32,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 05:12:32,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:12:32,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:12:32,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:12:32,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:12:32,455 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 05:12:32,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:12:32,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:12:32,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:12:32,627 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 50 treesize of output 45 [2024-11-14 05:12:32,632 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 24 treesize of output 11 [2024-11-14 05:12:32,701 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:12:32,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:12:32,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:12:32,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:12:32,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:12:32,748 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 50 treesize of output 45 [2024-11-14 05:12:32,757 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 24 treesize of output 11 [2024-11-14 05:12:32,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:12:32,945 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 7 treesize of output 3 [2024-11-14 05:12:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:12:32,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:12:33,152 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1135 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1135) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1135) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:12:33,241 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1131 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1131) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1132) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1135) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1131 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1132))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1131) .cse0 v_ArrVal_1135) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1136) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-14 05:12:33,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1131 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1132))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1131) .cse1 v_ArrVal_1135) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1136) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1131 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1131) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1132) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1135) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:12:33,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,272 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-14 05:12:33,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,280 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 05:12:33,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-11-14 05:12:33,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1831 treesize of output 1742 [2024-11-14 05:12:33,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-11-14 05:12:33,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 515 [2024-11-14 05:12:33,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 491 [2024-11-14 05:12:33,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,397 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 491 treesize of output 447 [2024-11-14 05:12:33,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,719 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-14 05:12:33,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:12:33,727 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-14 05:12:33,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:12:33,737 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 28 treesize of output 20 [2024-11-14 05:12:33,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:12:33,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 05:12:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:12:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817765512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:12:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [722435988] [2024-11-14 05:12:33,864 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-14 05:12:33,864 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:12:33,864 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:12:33,864 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:12:33,864 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:12:34,648 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:13:02,391 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9463#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~status~0#1| 1))' at error location [2024-11-14 05:13:02,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:13:02,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:13:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2024-11-14 05:13:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520873986] [2024-11-14 05:13:02,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:13:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 05:13:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:13:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 05:13:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1688, Unknown=15, NotChecked=258, Total=2162 [2024-11-14 05:13:02,393 INFO L87 Difference]: Start difference. First operand 206 states and 244 transitions. Second operand has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 states have internal predecessors, (114), 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 05:13:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:13:03,606 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2024-11-14 05:13:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:13:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 states have internal predecessors, (114), 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 39 [2024-11-14 05:13:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:13:03,607 INFO L225 Difference]: With dead ends: 215 [2024-11-14 05:13:03,607 INFO L226 Difference]: Without dead ends: 215 [2024-11-14 05:13:03,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=302, Invalid=2245, Unknown=15, NotChecked=300, Total=2862 [2024-11-14 05:13:03,608 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 711 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:13:03,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 654 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 837 Invalid, 0 Unknown, 560 Unchecked, 0.7s Time] [2024-11-14 05:13:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-14 05:13:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2024-11-14 05:13:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 173 states have (on average 1.3583815028901733) internal successors, (235), 204 states have internal predecessors, (235), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:13:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2024-11-14 05:13:03,614 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 39 [2024-11-14 05:13:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:13:03,614 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2024-11-14 05:13:03,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 25 states have internal predecessors, (114), 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 05:13:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2024-11-14 05:13:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 05:13:03,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:13:03,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:13:03,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:13:03,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-14 05:13:03,819 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:13:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:13:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1611425664, now seen corresponding path program 1 times [2024-11-14 05:13:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:13:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228146375] [2024-11-14 05:13:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:13:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:13:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:13:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:13:04,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:13:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228146375] [2024-11-14 05:13:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228146375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:13:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100076307] [2024-11-14 05:13:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:13:04,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:13:04,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:13:04,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:13:04,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:13:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:13:04,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:13:04,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:13:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:13:04,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:13:04,415 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 05:13:04,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:13:04,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:13:04,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:04,537 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 41 treesize of output 38 [2024-11-14 05:13:04,544 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 24 treesize of output 11 [2024-11-14 05:13:04,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 05:13:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:13:04,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:13:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:13:04,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:13:04,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1234 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1234) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1235) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1237) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse0 0) (= .cse0 0)))) is different from false [2024-11-14 05:13:04,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1234 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1234) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1235) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1237)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse0 0) (= .cse0 0)))) is different from false [2024-11-14 05:13:04,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:13:04,978 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2024-11-14 05:13:04,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:13:04,985 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2024-11-14 05:13:04,990 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 91 treesize of output 79 [2024-11-14 05:13:05,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:13:05,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 194 [2024-11-14 05:13:05,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 113 [2024-11-14 05:13:05,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2024-11-14 05:13:05,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 147 [2024-11-14 05:13:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:13:05,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100076307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:13:05,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [451303371] [2024-11-14 05:13:05,344 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-14 05:13:05,344 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:13:05,345 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:13:05,345 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:13:05,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:13:06,229 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:13:32,114 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10181#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~status~0#1| 1))' at error location [2024-11-14 05:13:32,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:13:32,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:13:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2024-11-14 05:13:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564152505] [2024-11-14 05:13:32,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:13:32,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:13:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:13:32,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:13:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1567, Unknown=24, NotChecked=166, Total=1980 [2024-11-14 05:13:32,116 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 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 05:13:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:13:32,981 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2024-11-14 05:13:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:13:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 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 40 [2024-11-14 05:13:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:13:32,983 INFO L225 Difference]: With dead ends: 221 [2024-11-14 05:13:32,983 INFO L226 Difference]: Without dead ends: 221 [2024-11-14 05:13:32,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=373, Invalid=2262, Unknown=25, NotChecked=202, Total=2862 [2024-11-14 05:13:32,984 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 586 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:13:32,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 802 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 655 Invalid, 0 Unknown, 372 Unchecked, 0.6s Time] [2024-11-14 05:13:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-14 05:13:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2024-11-14 05:13:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 205 states have internal predecessors, (236), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:13:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 244 transitions. [2024-11-14 05:13:32,991 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 244 transitions. Word has length 40 [2024-11-14 05:13:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:13:32,992 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 244 transitions. [2024-11-14 05:13:32,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 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 05:13:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 244 transitions. [2024-11-14 05:13:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 05:13:32,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:13:32,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:13:33,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:13:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-14 05:13:33,197 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:13:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:13:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1585411505, now seen corresponding path program 1 times [2024-11-14 05:13:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:13:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127031407] [2024-11-14 05:13:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:13:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:13:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:13:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:13:33,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:13:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127031407] [2024-11-14 05:13:33,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127031407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:13:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395788800] [2024-11-14 05:13:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:13:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:13:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:13:33,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:13:33,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:13:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:13:33,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:13:33,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:13:33,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:13:33,933 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:13:33,933 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 05:13:33,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:13:34,094 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:34,094 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 34 treesize of output 33 [2024-11-14 05:13:34,149 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:13:34,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:13:34,180 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:34,181 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 34 treesize of output 33 [2024-11-14 05:13:34,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:13:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:13:34,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:13:34,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1336) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-14 05:13:34,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1336)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-14 05:13:34,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1336)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-14 05:13:34,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:13:34,557 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-14 05:13:34,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:13:34,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 123 [2024-11-14 05:13:34,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:13:34,584 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 80 treesize of output 78 [2024-11-14 05:13:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2024-11-14 05:13:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:13:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395788800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:13:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [994568466] [2024-11-14 05:13:34,837 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-14 05:13:34,837 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:13:34,838 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:13:34,838 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:13:34,838 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:13:35,722 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:14:07,711 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10914#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~status~0#1| 1))' at error location [2024-11-14 05:14:07,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:14:07,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:14:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2024-11-14 05:14:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237902888] [2024-11-14 05:14:07,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:14:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:14:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:14:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1657, Unknown=18, NotChecked=258, Total=2162 [2024-11-14 05:14:07,712 INFO L87 Difference]: Start difference. First operand 207 states and 244 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 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 05:14:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:08,588 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2024-11-14 05:14:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:14:08,589 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 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 05:14:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:08,590 INFO L225 Difference]: With dead ends: 219 [2024-11-14 05:14:08,590 INFO L226 Difference]: Without dead ends: 219 [2024-11-14 05:14:08,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=316, Invalid=2128, Unknown=18, NotChecked=294, Total=2756 [2024-11-14 05:14:08,591 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 544 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:08,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 696 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 725 Invalid, 0 Unknown, 576 Unchecked, 0.6s Time] [2024-11-14 05:14:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-14 05:14:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2024-11-14 05:14:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.3542857142857143) internal successors, (237), 206 states have internal predecessors, (237), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:14:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2024-11-14 05:14:08,594 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 41 [2024-11-14 05:14:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:08,595 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2024-11-14 05:14:08,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 24 states have internal predecessors, (88), 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 05:14:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2024-11-14 05:14:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 05:14:08,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:08,595 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:08,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:14:08,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 05:14:08,800 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:14:08,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:08,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1903115934, now seen corresponding path program 1 times [2024-11-14 05:14:08,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248632011] [2024-11-14 05:14:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:14:08,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248632011] [2024-11-14 05:14:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248632011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:14:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161162270] [2024-11-14 05:14:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:08,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:14:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:14:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:14:08,863 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) 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 05:14:09,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:09,039 INFO L93 Difference]: Finished difference Result 215 states and 253 transitions. [2024-11-14 05:14:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:14:09,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) 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 42 [2024-11-14 05:14:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:09,040 INFO L225 Difference]: With dead ends: 215 [2024-11-14 05:14:09,040 INFO L226 Difference]: Without dead ends: 215 [2024-11-14 05:14:09,041 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 05:14:09,041 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 146 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:09,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 129 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:14:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-14 05:14:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2024-11-14 05:14:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3588235294117648) internal successors, (231), 200 states have internal predecessors, (231), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:14:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 239 transitions. [2024-11-14 05:14:09,047 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 239 transitions. Word has length 42 [2024-11-14 05:14:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 239 transitions. [2024-11-14 05:14:09,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) 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 05:14:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2024-11-14 05:14:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 05:14:09,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:09,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 05:14:09,048 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:14:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1856910232, now seen corresponding path program 1 times [2024-11-14 05:14:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95769782] [2024-11-14 05:14:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:14:09,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95769782] [2024-11-14 05:14:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95769782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:09,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:09,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:14:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46618359] [2024-11-14 05:14:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:14:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:14:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:14:09,116 INFO L87 Difference]: Start difference. First operand 202 states and 239 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 05:14:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:09,226 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2024-11-14 05:14:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:14:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-11-14 05:14:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:09,228 INFO L225 Difference]: With dead ends: 215 [2024-11-14 05:14:09,228 INFO L226 Difference]: Without dead ends: 215 [2024-11-14 05:14:09,228 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 05:14:09,228 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 30 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:09,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 305 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:14:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-14 05:14:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 196. [2024-11-14 05:14:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.329268292682927) internal successors, (218), 194 states have internal predecessors, (218), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:14:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 226 transitions. [2024-11-14 05:14:09,234 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 226 transitions. Word has length 42 [2024-11-14 05:14:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:09,234 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 226 transitions. [2024-11-14 05:14:09,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 05:14:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 226 transitions. [2024-11-14 05:14:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:14:09,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:09,235 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:09,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-14 05:14:09,235 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:14:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1048029460, now seen corresponding path program 1 times [2024-11-14 05:14:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364483892] [2024-11-14 05:14:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:14:09,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364483892] [2024-11-14 05:14:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364483892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:14:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692601023] [2024-11-14 05:14:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:14:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:09,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:14:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:14:09,296 INFO L87 Difference]: Start difference. First operand 196 states and 226 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:14:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:09,384 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2024-11-14 05:14:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:14:09,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-14 05:14:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:09,386 INFO L225 Difference]: With dead ends: 247 [2024-11-14 05:14:09,386 INFO L226 Difference]: Without dead ends: 247 [2024-11-14 05:14:09,386 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 05:14:09,386 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:09,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 223 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:14:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-14 05:14:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 215. [2024-11-14 05:14:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 213 states have internal predecessors, (238), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:14:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2024-11-14 05:14:09,394 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 43 [2024-11-14 05:14:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:09,394 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2024-11-14 05:14:09,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:14:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2024-11-14 05:14:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:14:09,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:09,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:09,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 05:14:09,395 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:14:09,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 101098404, now seen corresponding path program 1 times [2024-11-14 05:14:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715562812] [2024-11-14 05:14:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:14:10,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715562812] [2024-11-14 05:14:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715562812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:14:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214946907] [2024-11-14 05:14:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:10,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:14:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:14:10,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:14:10,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:14:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:10,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:14:10,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:14:10,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:14:10,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:14:10,467 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 05:14:10,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:14:10,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:14:10,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:14:10,531 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 41 treesize of output 38 [2024-11-14 05:14:10,534 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 24 treesize of output 11 [2024-11-14 05:14:10,601 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-14 05:14:10,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-14 05:14:10,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:10,626 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 19 treesize of output 18 [2024-11-14 05:14:10,684 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-14 05:14:10,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 58 [2024-11-14 05:14:10,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-14 05:14:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:14:11,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:14:13,853 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_173| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1597))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) (forall ((v_ArrVal_1603 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1598))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~item~0#1.offset_173| 8))) (let ((.cse0 (select (select (store .cse5 .cse3 (store (store (select .cse5 .cse3) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse4 v_ArrVal_1603)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1602 Int)) (= (select (let ((.cse1 (store .cse2 .cse3 (store (store (select .cse2 .cse3) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse4 v_ArrVal_1602)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse0) 0))))))) (< (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |v_ULTIMATE.start_main_~item~0#1.offset_173|)))) (forall ((v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_173| Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1597))) (or (forall ((v_ArrVal_1603 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1598))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse9 (+ |v_ULTIMATE.start_main_~item~0#1.offset_173| 8))) (let ((.cse6 (store .cse11 .cse8 (store (store (select .cse11 .cse8) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse9 v_ArrVal_1603)))) (let ((.cse10 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_ArrVal_1602 Int)) (= (select (select .cse6 (select (select (store .cse7 .cse8 (store (store (select .cse7 .cse8) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse9 v_ArrVal_1602)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse10) 0)) (< .cse10 0))))))) (< |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) (< (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |v_ULTIMATE.start_main_~item~0#1.offset_173|))))) is different from false [2024-11-14 05:14:13,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_173| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1597))) (or (forall ((v_ArrVal_1603 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1598))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~item~0#1.offset_173| 8))) (let ((.cse1 (store .cse5 .cse3 (store (store (select .cse5 .cse3) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse4 v_ArrVal_1603)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1602 Int)) (= (select (select .cse1 (select (select (store .cse2 .cse3 (store (store (select .cse2 .cse3) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse4 v_ArrVal_1602)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse0) 0)))))))) (< |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) (< (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |v_ULTIMATE.start_main_~item~0#1.offset_173|)))) (forall ((v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_173| Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1597))) (or (forall ((v_ArrVal_1603 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1598))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse11 (+ |v_ULTIMATE.start_main_~item~0#1.offset_173| 8))) (let ((.cse7 (select (select (store .cse12 .cse10 (store (store (select .cse12 .cse10) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse11 v_ArrVal_1603)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< .cse7 0) (forall ((v_ArrVal_1602 Int)) (= (select (let ((.cse8 (store .cse9 .cse10 (store (store (select .cse9 .cse10) |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) .cse11 v_ArrVal_1602)))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse7) 0))))))) (< |v_ULTIMATE.start_main_~item~0#1.offset_173| 0) (< (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |v_ULTIMATE.start_main_~item~0#1.offset_173|)))))) is different from false [2024-11-14 05:14:13,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:14:13,955 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 301 treesize of output 269 [2024-11-14 05:14:13,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:14:13,965 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 163 [2024-11-14 05:14:14,667 INFO L349 Elim1Store]: treesize reduction 112, result has 72.1 percent of original size [2024-11-14 05:14:14,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 6059 treesize of output 5349 [2024-11-14 05:14:14,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:14:15,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:14:15,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9727 treesize of output 9361 [2024-11-14 05:14:15,720 INFO L349 Elim1Store]: treesize reduction 76, result has 68.5 percent of original size [2024-11-14 05:14:15,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 9938 treesize of output 9152 [2024-11-14 05:14:16,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:14:16,294 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 6843 treesize of output 6689 [2024-11-14 05:14:18,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-14 05:14:59,490 INFO L349 Elim1Store]: treesize reduction 26, result has 67.1 percent of original size [2024-11-14 05:14:59,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3963 treesize of output 3959 [2024-11-14 05:15:09,354 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:15:15,096 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 05:18:33,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 05:18:33,196 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 05:18:33,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 05:18:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1332466135] [2024-11-14 05:18:33,199 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2024-11-14 05:18:33,200 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:18:33,200 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:18:33,200 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:18:33,200 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:18:33,210 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 05:18:33,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:18:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-14 05:18:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855341724] [2024-11-14 05:18:33,215 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:18:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:18:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:18:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=477, Unknown=3, NotChecked=90, Total=650 [2024-11-14 05:18:33,216 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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 05:18:33,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=80, Invalid=477, Unknown=3, NotChecked=90, Total=650 [2024-11-14 05:18:33,218 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:33,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:18:33,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:18:33,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 05:18:33,419 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 05:18:33,422 INFO L158 Benchmark]: Toolchain (without parser) took 590245.04ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 90.4MB in the beginning and 682.0MB in the end (delta: -591.6MB). Peak memory consumption was 864.7MB. Max. memory is 16.1GB. [2024-11-14 05:18:33,422 INFO L158 Benchmark]: CDTParser took 1.62ms. Allocated memory is still 83.9MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:18:33,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.65ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 72.4MB in the end (delta: 18.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:18:33,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.32ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:18:33,423 INFO L158 Benchmark]: Boogie Preprocessor took 48.88ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:18:33,423 INFO L158 Benchmark]: RCFGBuilder took 993.36ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 88.9MB in the end (delta: -20.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-14 05:18:33,424 INFO L158 Benchmark]: TraceAbstraction took 588580.58ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 88.2MB in the beginning and 682.0MB in the end (delta: -593.7MB). Peak memory consumption was 859.3MB. Max. memory is 16.1GB. [2024-11-14 05:18:33,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62ms. Allocated memory is still 83.9MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.65ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 72.4MB in the end (delta: 18.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.32ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.88ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 993.36ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 88.9MB in the end (delta: -20.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 588580.58ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 88.2MB in the beginning and 682.0MB in the end (delta: -593.7MB). Peak memory consumption was 859.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/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_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:18:35,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:18:36,095 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 05:18:36,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:18:36,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:18:36,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:18:36,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:18:36,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:18:36,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:18:36,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:18:36,174 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:18:36,174 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:18:36,174 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:18:36,174 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:18:36,174 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:18:36,174 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:18:36,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:18:36,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:18:36,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:18:36,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:18:36,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:18:36,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:18:36,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:18:36,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:18:36,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:18:36,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:18:36,180 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:18:36,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:18:36,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:18:36,181 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:18:36,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_7a414c7e-afe1-4ada-9e25-aea9590d768a/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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2024-11-14 05:18:36,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:18:36,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:18:36,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:18:36,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:18:36,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:18:36,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-queue-1.i Unable to find full path for "g++" [2024-11-14 05:18:38,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:18:38,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:18:38,895 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/sv-benchmarks/c/forester-heap/dll-queue-1.i [2024-11-14 05:18:38,922 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data/b914dd9e9/9eb89743da1749a4994c3d9f21264ec1/FLAGd35eff0e5 [2024-11-14 05:18:39,157 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/data/b914dd9e9/9eb89743da1749a4994c3d9f21264ec1 [2024-11-14 05:18:39,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:18:39,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:18:39,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:18:39,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:18:39,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:18:39,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a877d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39, skipping insertion in model container [2024-11-14 05:18:39,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:18:39,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:18:39,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:18:39,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:18:39,820 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:18:39,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39 WrapperNode [2024-11-14 05:18:39,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:18:39,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:18:39,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:18:39,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:18:39,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,870 INFO L138 Inliner]: procedures = 122, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 209 [2024-11-14 05:18:39,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:18:39,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:18:39,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:18:39,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:18:39,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:18:39,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:18:39,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:18:39,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:18:39,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (1/1) ... [2024-11-14 05:18:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:18:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:39,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:18:39,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:18:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 05:18:39,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 05:18:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:18:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:18:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:18:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:18:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:18:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:18:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:18:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:18:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:18:39,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:18:40,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:18:40,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:18:40,943 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-14 05:18:40,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:18:40,962 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:18:40,964 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-14 05:18:40,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:18:40 BoogieIcfgContainer [2024-11-14 05:18:40,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:18:40,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:18:40,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:18:40,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:18:40,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:18:39" (1/3) ... [2024-11-14 05:18:40,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11934beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:18:40, skipping insertion in model container [2024-11-14 05:18:40,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:18:39" (2/3) ... [2024-11-14 05:18:40,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11934beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:18:40, skipping insertion in model container [2024-11-14 05:18:40,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:18:40" (3/3) ... [2024-11-14 05:18:40,978 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2024-11-14 05:18:40,997 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:18:41,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-queue-1.i that has 2 procedures, 186 locations, 1 initial locations, 17 loop locations, and 63 error locations. [2024-11-14 05:18:41,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:18:41,073 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;@33f14cf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:18:41,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-11-14 05:18:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 107 states have (on average 2.121495327102804) internal successors, (227), 170 states have internal predecessors, (227), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-14 05:18:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:18:41,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:41,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:18:41,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-14 05:18:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:41,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055725314] [2024-11-14 05:18:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:41,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:41,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:18:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:41,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:18:41,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:41,263 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 7 [2024-11-14 05:18:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:41,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:41,293 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055725314] [2024-11-14 05:18:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055725314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:41,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:18:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002311805] [2024-11-14 05:18:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:18:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:18:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:41,332 INFO L87 Difference]: Start difference. First operand has 186 states, 107 states have (on average 2.121495327102804) internal successors, (227), 170 states have internal predecessors, (227), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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 05:18:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:41,781 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2024-11-14 05:18:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:18:41,784 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 05:18:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:41,796 INFO L225 Difference]: With dead ends: 161 [2024-11-14 05:18:41,796 INFO L226 Difference]: Without dead ends: 159 [2024-11-14 05:18:41,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:41,803 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:41,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 118 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-14 05:18:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-14 05:18:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 93 states have (on average 1.8279569892473118) internal successors, (170), 157 states have internal predecessors, (170), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2024-11-14 05:18:41,860 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 3 [2024-11-14 05:18:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2024-11-14 05:18:41,860 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 05:18:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2024-11-14 05:18:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:18:41,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:41,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:18:41,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 05:18:42,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:42,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:42,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-14 05:18:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303980336] [2024-11-14 05:18:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:42,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:42,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:42,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:18:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:42,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:18:42,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:42,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:18:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:42,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:42,144 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303980336] [2024-11-14 05:18:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303980336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:18:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234245210] [2024-11-14 05:18:42,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:18:42,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:18:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:42,148 INFO L87 Difference]: Start difference. First operand 159 states and 184 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 05:18:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:42,562 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2024-11-14 05:18:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:18:42,563 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 05:18:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:42,564 INFO L225 Difference]: With dead ends: 148 [2024-11-14 05:18:42,564 INFO L226 Difference]: Without dead ends: 148 [2024-11-14 05:18:42,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:42,565 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 137 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:42,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 119 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-14 05:18:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-14 05:18:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.6989247311827957) internal successors, (158), 146 states have internal predecessors, (158), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2024-11-14 05:18:42,585 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 3 [2024-11-14 05:18:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:42,585 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2024-11-14 05:18:42,586 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 05:18:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-11-14 05:18:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:18:42,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:42,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:42,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 05:18:42,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:42,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:42,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-14 05:18:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:42,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406063422] [2024-11-14 05:18:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:42,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:42,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:42,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:42,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:18:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:42,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:18:42,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:42,890 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 7 [2024-11-14 05:18:42,956 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:18:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:18:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:42,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:42,977 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406063422] [2024-11-14 05:18:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406063422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:42,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517665334] [2024-11-14 05:18:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:18:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:18:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:18:42,979 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 05:18:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:43,395 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2024-11-14 05:18:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-14 05:18:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:43,400 INFO L225 Difference]: With dead ends: 151 [2024-11-14 05:18:43,400 INFO L226 Difference]: Without dead ends: 151 [2024-11-14 05:18:43,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 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 05:18:43,401 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 231 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:43,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 124 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-14 05:18:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-11-14 05:18:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.63) internal successors, (163), 147 states have internal predecessors, (163), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-11-14 05:18:43,416 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 9 [2024-11-14 05:18:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:43,417 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-11-14 05:18:43,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 05:18:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-11-14 05:18:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:18:43,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:43,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:43,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:43,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:43,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-14 05:18:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251758240] [2024-11-14 05:18:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:43,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:43,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:18:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:43,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:18:43,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:43,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:18:43,867 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 05:18:43,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 05:18:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:43,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:43,889 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251758240] [2024-11-14 05:18:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251758240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:43,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:43,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:43,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078730400] [2024-11-14 05:18:43,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:18:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:43,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:18:43,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:18:43,891 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 05:18:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:44,547 INFO L93 Difference]: Finished difference Result 225 states and 267 transitions. [2024-11-14 05:18:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-14 05:18:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:44,551 INFO L225 Difference]: With dead ends: 225 [2024-11-14 05:18:44,552 INFO L226 Difference]: Without dead ends: 225 [2024-11-14 05:18:44,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 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 05:18:44,553 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 285 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:44,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 182 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:18:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-14 05:18:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 157. [2024-11-14 05:18:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 155 states have internal predecessors, (173), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2024-11-14 05:18:44,579 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 9 [2024-11-14 05:18:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:44,579 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2024-11-14 05:18:44,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 05:18:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2024-11-14 05:18:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:18:44,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:44,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:44,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 05:18:44,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:44,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:44,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1909373097, now seen corresponding path program 1 times [2024-11-14 05:18:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991717853] [2024-11-14 05:18:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:44,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:44,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:44,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:44,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 05:18:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:44,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:18:44,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:44,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:44,902 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991717853] [2024-11-14 05:18:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991717853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138626528] [2024-11-14 05:18:44,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:18:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:18:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:44,904 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:44,997 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2024-11-14 05:18:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:18:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 05:18:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:44,999 INFO L225 Difference]: With dead ends: 152 [2024-11-14 05:18:44,999 INFO L226 Difference]: Without dead ends: 152 [2024-11-14 05:18:44,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:45,000 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 121 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:45,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 154 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:18:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-14 05:18:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-14 05:18:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 150 states have internal predecessors, (167), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2024-11-14 05:18:45,022 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 12 [2024-11-14 05:18:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:45,022 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2024-11-14 05:18:45,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2024-11-14 05:18:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:18:45,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:45,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:45,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 05:18:45,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:45,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-14 05:18:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:45,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54141147] [2024-11-14 05:18:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:45,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:45,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:45,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 05:18:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:45,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:18:45,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:45,341 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 7 [2024-11-14 05:18:45,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:18:45,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-14 05:18:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:45,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:45,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54141147] [2024-11-14 05:18:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54141147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:18:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928669635] [2024-11-14 05:18:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:45,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:18:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:18:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:45,418 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 05:18:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:45,896 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2024-11-14 05:18:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-14 05:18:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:45,899 INFO L225 Difference]: With dead ends: 151 [2024-11-14 05:18:45,899 INFO L226 Difference]: Without dead ends: 151 [2024-11-14 05:18:45,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 05:18:45,900 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 4 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:45,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 430 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:18:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-14 05:18:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-14 05:18:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 149 states have internal predecessors, (165), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 174 transitions. [2024-11-14 05:18:45,917 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 174 transitions. Word has length 12 [2024-11-14 05:18:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:45,917 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 174 transitions. [2024-11-14 05:18:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 05:18:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2024-11-14 05:18:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:18:45,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:45,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:45,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:46,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-14 05:18:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772371456] [2024-11-14 05:18:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:46,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:46,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 05:18:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:46,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:18:46,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:46,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:18:46,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:18:46,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:18:46,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:18:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:46,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:46,340 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772371456] [2024-11-14 05:18:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772371456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:18:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816411064] [2024-11-14 05:18:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:46,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:18:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:46,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:18:46,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:46,342 INFO L87 Difference]: Start difference. First operand 151 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 05:18:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:46,890 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2024-11-14 05:18:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:46,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-14 05:18:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:46,892 INFO L225 Difference]: With dead ends: 150 [2024-11-14 05:18:46,892 INFO L226 Difference]: Without dead ends: 150 [2024-11-14 05:18:46,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:18:46,893 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 2 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:46,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 432 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:18:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-14 05:18:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-14 05:18:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 148 states have internal predecessors, (163), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2024-11-14 05:18:46,904 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 12 [2024-11-14 05:18:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:46,904 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2024-11-14 05:18:46,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 05:18:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2024-11-14 05:18:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:18:46,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:46,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:46,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 05:18:47,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:47,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-14 05:18:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:47,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129875697] [2024-11-14 05:18:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:47,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:47,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:47,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 05:18:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:47,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 05:18:47,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:47,251 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 7 [2024-11-14 05:18:47,318 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:18:47,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:18:47,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:18:47,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:18:47,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:18:47,550 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:18:47,551 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 50 treesize of output 45 [2024-11-14 05:18:47,560 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 24 treesize of output 11 [2024-11-14 05:18:47,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:18:47,627 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 7 treesize of output 3 [2024-11-14 05:18:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:47,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:47,685 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:47,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129875697] [2024-11-14 05:18:47,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129875697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:47,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:47,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:18:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283014541] [2024-11-14 05:18:47,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:47,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:18:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:47,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:18:47,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:18:47,688 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 05:18:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:49,327 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2024-11-14 05:18:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:18:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-14 05:18:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:49,329 INFO L225 Difference]: With dead ends: 206 [2024-11-14 05:18:49,329 INFO L226 Difference]: Without dead ends: 206 [2024-11-14 05:18:49,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:18:49,330 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 298 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:49,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 564 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:18:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-14 05:18:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2024-11-14 05:18:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 100 states have (on average 1.47) internal successors, (147), 133 states have internal predecessors, (147), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2024-11-14 05:18:49,335 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 16 [2024-11-14 05:18:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:49,335 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2024-11-14 05:18:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 05:18:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2024-11-14 05:18:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:18:49,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:49,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:49,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:49,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-14 05:18:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60502004] [2024-11-14 05:18:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:49,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:49,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:49,545 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:49,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 05:18:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:49,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:18:49,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:49,706 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 05:18:49,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-14 05:18:49,889 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:18:49,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-14 05:18:49,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:18:50,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:18:50,157 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 52 treesize of output 49 [2024-11-14 05:18:50,225 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 43 treesize of output 27 [2024-11-14 05:18:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:50,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:50,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60502004] [2024-11-14 05:18:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60502004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:18:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007539293] [2024-11-14 05:18:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:18:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:18:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:18:50,439 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 05:18:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:51,893 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2024-11-14 05:18:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:18:51,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-14 05:18:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:51,894 INFO L225 Difference]: With dead ends: 198 [2024-11-14 05:18:51,894 INFO L226 Difference]: Without dead ends: 198 [2024-11-14 05:18:51,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:18:51,895 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 425 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:51,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 570 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:18:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-14 05:18:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2024-11-14 05:18:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 131 states have internal predecessors, (145), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2024-11-14 05:18:51,901 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 16 [2024-11-14 05:18:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:51,901 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2024-11-14 05:18:51,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 05:18:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2024-11-14 05:18:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:18:51,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:51,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:18:51,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 05:18:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:52,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1835355111, now seen corresponding path program 1 times [2024-11-14 05:18:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225304608] [2024-11-14 05:18:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:52,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:52,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:52,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:52,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 05:18:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:52,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:18:52,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:52,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:52,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225304608] [2024-11-14 05:18:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225304608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989824174] [2024-11-14 05:18:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:52,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:18:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:18:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:52,201 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:52,240 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2024-11-14 05:18:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:18:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 05:18:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:52,242 INFO L225 Difference]: With dead ends: 190 [2024-11-14 05:18:52,242 INFO L226 Difference]: Without dead ends: 190 [2024-11-14 05:18:52,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:18:52,243 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 47 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:52,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 259 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:18:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-14 05:18:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2024-11-14 05:18:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.396551724137931) internal successors, (162), 147 states have internal predecessors, (162), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2024-11-14 05:18:52,249 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 18 [2024-11-14 05:18:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:52,249 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2024-11-14 05:18:52,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2024-11-14 05:18:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:18:52,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:52,253 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] [2024-11-14 05:18:52,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-14 05:18:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:52,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1801291997, now seen corresponding path program 1 times [2024-11-14 05:18:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834960686] [2024-11-14 05:18:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:52,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:52,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:52,456 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:52,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 05:18:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:52,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:18:52,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:52,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:52,563 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834960686] [2024-11-14 05:18:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834960686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:52,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:18:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381339355] [2024-11-14 05:18:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:18:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:18:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:18:52,564 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 05:18:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:52,619 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2024-11-14 05:18:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:18:52,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-14 05:18:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:52,620 INFO L225 Difference]: With dead ends: 182 [2024-11-14 05:18:52,620 INFO L226 Difference]: Without dead ends: 182 [2024-11-14 05:18:52,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 05:18:52,621 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 34 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:52,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 386 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:18:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-14 05:18:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 160. [2024-11-14 05:18:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 158 states have internal predecessors, (176), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2024-11-14 05:18:52,626 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 21 [2024-11-14 05:18:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2024-11-14 05:18:52,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 05:18:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2024-11-14 05:18:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:18:52,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:52,628 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] [2024-11-14 05:18:52,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-14 05:18:52,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:52,828 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:52,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:52,829 INFO L85 PathProgramCache]: Analyzing trace with hash -189938738, now seen corresponding path program 1 times [2024-11-14 05:18:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:52,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649783411] [2024-11-14 05:18:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:52,831 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:52,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 05:18:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:52,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:18:52,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:53,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:53,081 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649783411] [2024-11-14 05:18:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649783411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:18:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681762172] [2024-11-14 05:18:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:18:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:18:53,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:18:53,083 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 05:18:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:53,402 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2024-11-14 05:18:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:18:53,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-14 05:18:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:53,404 INFO L225 Difference]: With dead ends: 160 [2024-11-14 05:18:53,404 INFO L226 Difference]: Without dead ends: 160 [2024-11-14 05:18:53,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:18:53,405 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 246 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:53,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 209 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:18:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-14 05:18:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-14 05:18:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 158 states have internal predecessors, (175), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2024-11-14 05:18:53,411 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 23 [2024-11-14 05:18:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:53,412 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2024-11-14 05:18:53,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 05:18:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2024-11-14 05:18:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:18:53,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:53,413 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] [2024-11-14 05:18:53,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 05:18:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:53,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -169825771, now seen corresponding path program 1 times [2024-11-14 05:18:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:53,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120512452] [2024-11-14 05:18:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:53,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:53,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 05:18:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:53,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:18:53,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:53,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:18:53,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:18:53,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:18:53,772 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 21 treesize of output 20 [2024-11-14 05:18:53,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:18:53,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-14 05:18:53,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:18:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:53,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:18:53,999 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120512452] [2024-11-14 05:18:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120512452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:18:53,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:18:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:18:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896942542] [2024-11-14 05:18:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:18:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:18:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:18:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:18:54,000 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 05:18:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:54,423 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2024-11-14 05:18:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:18:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2024-11-14 05:18:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:54,425 INFO L225 Difference]: With dead ends: 157 [2024-11-14 05:18:54,425 INFO L226 Difference]: Without dead ends: 157 [2024-11-14 05:18:54,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:18:54,426 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 18 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:54,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 593 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:18:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-14 05:18:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-11-14 05:18:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 152 states have internal predecessors, (165), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2024-11-14 05:18:54,431 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 23 [2024-11-14 05:18:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2024-11-14 05:18:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 05:18:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2024-11-14 05:18:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:18:54,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:54,432 INFO L215 NwaCegarLoop]: trace histogram [2, 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 05:18:54,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-14 05:18:54,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:54,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:54,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1909386788, now seen corresponding path program 1 times [2024-11-14 05:18:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998928295] [2024-11-14 05:18:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:54,638 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:54,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 05:18:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:54,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:18:54,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:54,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:55,136 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:55,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998928295] [2024-11-14 05:18:55,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998928295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:55,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1732766583] [2024-11-14 05:18:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:55,137 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:18:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:18:55,141 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:18:55,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-14 05:18:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:55,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:18:55,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:55,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1732766583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857248531] [2024-11-14 05:18:55,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:55,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:55,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:55,506 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:55,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 05:18:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:55,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:18:55,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:55,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:18:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857248531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:55,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:18:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 11 [2024-11-14 05:18:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798919839] [2024-11-14 05:18:55,795 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:55,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:18:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:18:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:18:55,796 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 05:18:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:56,984 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2024-11-14 05:18:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:18:56,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 26 [2024-11-14 05:18:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:56,986 INFO L225 Difference]: With dead ends: 177 [2024-11-14 05:18:56,986 INFO L226 Difference]: Without dead ends: 177 [2024-11-14 05:18:56,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:18:56,987 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 96 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:56,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 754 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 05:18:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-14 05:18:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2024-11-14 05:18:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 162 states have internal predecessors, (176), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2024-11-14 05:18:56,995 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 26 [2024-11-14 05:18:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:56,995 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2024-11-14 05:18:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 05:18:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2024-11-14 05:18:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:18:56,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:56,998 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] [2024-11-14 05:18:57,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-14 05:18:57,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-14 05:18:57,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 05:18:57,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:57,599 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:18:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:18:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash -938552825, now seen corresponding path program 1 times [2024-11-14 05:18:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:18:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688122798] [2024-11-14 05:18:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:57,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:18:57,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:18:57,602 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:18:57,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 05:18:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:57,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:18:57,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:57,840 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item~0#1.base_54| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_54|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_54| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-14 05:18:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-14 05:18:57,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:57,981 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 05:18:57,982 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:18:57,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688122798] [2024-11-14 05:18:57,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688122798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:57,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1680403562] [2024-11-14 05:18:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:57,982 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:18:57,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:18:57,984 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:18:57,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-14 05:18:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:58,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:18:58,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:58,421 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 05:18:58,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:58,542 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 05:18:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1680403562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921864108] [2024-11-14 05:18:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:18:58,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:18:58,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:18:58,549 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:18:58,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 05:18:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:18:58,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:18:58,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:18:58,764 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item~0#1.base_64| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_64| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_64|)))) is different from true [2024-11-14 05:18:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-14 05:18:58,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:18:58,895 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 05:18:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921864108] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:18:58,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:18:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 10 [2024-11-14 05:18:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547511721] [2024-11-14 05:18:58,895 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:18:58,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:18:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:18:58,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:18:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2024-11-14 05:18:58,896 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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 05:18:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:18:59,661 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2024-11-14 05:18:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:18:59,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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 27 [2024-11-14 05:18:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:18:59,663 INFO L225 Difference]: With dead ends: 174 [2024-11-14 05:18:59,663 INFO L226 Difference]: Without dead ends: 155 [2024-11-14 05:18:59,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=96, Unknown=2, NotChecked=42, Total=182 [2024-11-14 05:18:59,663 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 171 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:18:59,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 492 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 339 Invalid, 4 Unknown, 318 Unchecked, 0.7s Time] [2024-11-14 05:18:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-14 05:18:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-14 05:18:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.360655737704918) internal successors, (166), 153 states have internal predecessors, (166), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:18:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2024-11-14 05:18:59,669 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 27 [2024-11-14 05:18:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:18:59,669 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2024-11-14 05:18:59,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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 05:18:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2024-11-14 05:18:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:18:59,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:18:59,670 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:59,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 05:18:59,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 05:19:00,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-14 05:19:00,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:19:00,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:19:00,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash -469123258, now seen corresponding path program 1 times [2024-11-14 05:19:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:19:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344518654] [2024-11-14 05:19:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:00,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:19:00,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:19:00,277 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:19:00,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-14 05:19:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:00,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:19:00,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:00,436 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 7 [2024-11-14 05:19:00,502 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:19:00,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:19:00,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:00,634 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:00,634 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 33 treesize of output 32 [2024-11-14 05:19:00,722 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:00,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-14 05:19:00,759 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:00,759 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 33 treesize of output 32 [2024-11-14 05:19:00,847 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 24 treesize of output 12 [2024-11-14 05:19:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:00,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:00,972 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2024-11-14 05:19:01,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_481))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_483)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 05:19:01,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_481))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_483)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 05:19:01,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:01,063 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-14 05:19:01,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:01,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2024-11-14 05:19:01,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:01,108 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 76 treesize of output 75 [2024-11-14 05:19:01,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-14 05:19:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:02,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:19:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344518654] [2024-11-14 05:19:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344518654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581816155] [2024-11-14 05:19:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:02,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:19:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:19:02,431 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:19:02,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-14 05:19:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:02,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:19:02,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:02,717 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 7 [2024-11-14 05:19:02,837 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:19:02,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:19:02,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:02,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:19:03,067 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:03,067 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 41 treesize of output 38 [2024-11-14 05:19:03,077 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 24 treesize of output 11 [2024-11-14 05:19:03,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:19:03,250 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:03,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 05:19:03,286 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:03,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 05:19:03,447 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 24 treesize of output 12 [2024-11-14 05:19:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:03,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:03,846 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_534))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (_ bv0 32) (select (select (store .cse0 .cse1 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 32) .cse1))))) (or (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_534))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (_ bv0 32))))) is different from false [2024-11-14 05:19:03,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_534))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= (_ bv0 32) .cse0) (not (= (_ bv0 32) (select (select (store .cse1 .cse0 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (or (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_534))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_535) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) is different from false [2024-11-14 05:19:03,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:03,917 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2024-11-14 05:19:03,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:03,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 217 [2024-11-14 05:19:03,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:03,970 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 100 treesize of output 96 [2024-11-14 05:19:03,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2024-11-14 05:19:04,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:04,203 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-14 05:19:04,232 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-11-14 05:19:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 217 [2024-11-14 05:19:04,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:04,253 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 144 treesize of output 141 [2024-11-14 05:19:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 126 [2024-11-14 05:19:04,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:04,372 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 05:19:04,378 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 30 treesize of output 22 [2024-11-14 05:19:04,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:19:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:05,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [581816155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:05,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399191955] [2024-11-14 05:19:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:05,048 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:05,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 05:19:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:05,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:19:05,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:05,171 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 7 [2024-11-14 05:19:05,227 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:19:05,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:19:05,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:05,298 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:05,298 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 33 treesize of output 32 [2024-11-14 05:19:05,350 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:05,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-14 05:19:05,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:05,393 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 33 treesize of output 32 [2024-11-14 05:19:05,462 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 24 treesize of output 12 [2024-11-14 05:19:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:05,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:05,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_483)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 05:19:05,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_483)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 05:19:05,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:05,574 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-14 05:19:05,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:05,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2024-11-14 05:19:05,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:05,618 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 76 treesize of output 75 [2024-11-14 05:19:05,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-14 05:19:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399191955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:07,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:19:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 13, 11, 12] total 37 [2024-11-14 05:19:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26473538] [2024-11-14 05:19:07,849 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:07,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 05:19:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:19:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 05:19:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=759, Unknown=16, NotChecked=434, Total=1332 [2024-11-14 05:19:07,852 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand has 37 states, 37 states have (on average 3.108108108108108) internal successors, (115), 37 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:13,454 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2024-11-14 05:19:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:19:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.108108108108108) internal successors, (115), 37 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-14 05:19:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:13,456 INFO L225 Difference]: With dead ends: 328 [2024-11-14 05:19:13,456 INFO L226 Difference]: Without dead ends: 328 [2024-11-14 05:19:13,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=295, Invalid=1353, Unknown=20, NotChecked=588, Total=2256 [2024-11-14 05:19:13,457 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1008 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 31 mSolverCounterUnsat, 117 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 117 IncrementalHoareTripleChecker+Unknown, 2294 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:13,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 1350 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1100 Invalid, 117 Unknown, 2294 Unchecked, 4.8s Time] [2024-11-14 05:19:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-14 05:19:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 170. [2024-11-14 05:19:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2024-11-14 05:19:13,466 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 35 [2024-11-14 05:19:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:13,466 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2024-11-14 05:19:13,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.108108108108108) internal successors, (115), 37 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2024-11-14 05:19:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:19:13,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:13,467 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:13,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-14 05:19:13,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 05:19:13,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-14 05:19:14,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:19:14,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:19:14,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash 413076813, now seen corresponding path program 1 times [2024-11-14 05:19:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:19:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902581655] [2024-11-14 05:19:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:14,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:19:14,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:19:14,076 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:19:14,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-14 05:19:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:14,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:19:14,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:14,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:19:14,204 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:19:14,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902581655] [2024-11-14 05:19:14,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902581655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:19:14,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:19:14,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:19:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004406294] [2024-11-14 05:19:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:19:14,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:19:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:19:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:19:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:19:14,205 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:14,252 INFO L93 Difference]: Finished difference Result 243 states and 270 transitions. [2024-11-14 05:19:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:19:14,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 05:19:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:14,253 INFO L225 Difference]: With dead ends: 243 [2024-11-14 05:19:14,253 INFO L226 Difference]: Without dead ends: 243 [2024-11-14 05:19:14,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:19:14,254 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 54 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:14,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 262 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:19:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-14 05:19:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2024-11-14 05:19:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 189 states have internal predecessors, (204), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2024-11-14 05:19:14,261 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 36 [2024-11-14 05:19:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:14,261 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2024-11-14 05:19:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2024-11-14 05:19:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:19:14,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:14,262 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:14,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-14 05:19:14,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:19:14,463 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:19:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash -797292886, now seen corresponding path program 1 times [2024-11-14 05:19:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:19:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791652074] [2024-11-14 05:19:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:19:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:19:14,468 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:19:14,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-14 05:19:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:14,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:19:14,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:14,664 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 7 [2024-11-14 05:19:14,760 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:19:14,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:19:14,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:15,002 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:15,002 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 36 treesize of output 35 [2024-11-14 05:19:15,165 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:15,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 05:19:15,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:15,224 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 36 treesize of output 35 [2024-11-14 05:19:15,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:19:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:15,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:15,680 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:15,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:15,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_684))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_686)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:15,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_684))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_686)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:15,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:15,790 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-14 05:19:15,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:15,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 139 [2024-11-14 05:19:15,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2024-11-14 05:19:15,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:15,847 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 84 treesize of output 82 [2024-11-14 05:19:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:29,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:19:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791652074] [2024-11-14 05:19:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791652074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602726844] [2024-11-14 05:19:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:29,135 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:19:29,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:19:29,137 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:19:29,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 05:19:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:29,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 05:19:29,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:29,499 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:19:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:19:29,773 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:19:29,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-14 05:19:29,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:30,170 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:30,170 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 44 treesize of output 41 [2024-11-14 05:19:30,470 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:30,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 32 [2024-11-14 05:19:30,542 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:30,542 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 44 treesize of output 41 [2024-11-14 05:19:30,993 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 35 treesize of output 19 [2024-11-14 05:19:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:31,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:31,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 1))) is different from false [2024-11-14 05:19:31,490 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_737))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_686)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2024-11-14 05:19:31,501 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_737))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_686)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:31,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:31,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-14 05:19:31,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:31,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 139 [2024-11-14 05:19:31,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2024-11-14 05:19:31,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:31,572 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 84 treesize of output 82 [2024-11-14 05:19:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:39,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1602726844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:39,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356541624] [2024-11-14 05:19:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:39,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:19:39,203 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:19:39,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 05:19:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:39,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 05:19:39,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:39,353 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 7 [2024-11-14 05:19:39,434 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:19:39,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 05:19:39,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:39,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:39,578 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 36 treesize of output 35 [2024-11-14 05:19:39,681 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:39,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 05:19:39,742 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:39,742 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 36 treesize of output 35 [2024-11-14 05:19:39,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:19:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:39,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:40,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:40,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:40,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_791) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:40,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_789))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_791)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:40,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_789))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_791)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:40,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:40,139 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-14 05:19:40,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:40,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 243 [2024-11-14 05:19:40,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 179 [2024-11-14 05:19:40,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:40,196 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 179 treesize of output 175 [2024-11-14 05:19:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:48,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356541624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:48,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:19:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 12, 11, 12] total 42 [2024-11-14 05:19:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649077329] [2024-11-14 05:19:48,549 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:19:48,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 05:19:48,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:19:48,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 05:19:48,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=740, Unknown=24, NotChecked=828, Total=1806 [2024-11-14 05:19:48,551 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand has 43 states, 42 states have (on average 3.5) internal successors, (147), 43 states have internal predecessors, (147), 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 05:19:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:19:52,176 INFO L93 Difference]: Finished difference Result 326 states and 370 transitions. [2024-11-14 05:19:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:19:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5) internal successors, (147), 43 states have internal predecessors, (147), 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 43 [2024-11-14 05:19:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:19:52,177 INFO L225 Difference]: With dead ends: 326 [2024-11-14 05:19:52,177 INFO L226 Difference]: Without dead ends: 326 [2024-11-14 05:19:52,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 206 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=322, Invalid=1108, Unknown=24, NotChecked=996, Total=2450 [2024-11-14 05:19:52,179 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1001 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3816 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:19:52,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 869 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 782 Invalid, 0 Unknown, 3816 Unchecked, 2.9s Time] [2024-11-14 05:19:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-14 05:19:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 203. [2024-11-14 05:19:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:19:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2024-11-14 05:19:52,185 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 43 [2024-11-14 05:19:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:19:52,186 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2024-11-14 05:19:52,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5) internal successors, (147), 43 states have internal predecessors, (147), 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 05:19:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2024-11-14 05:19:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 05:19:52,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:19:52,187 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:52,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-14 05:19:52,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 05:19:52,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 05:19:52,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:19:52,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:19:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:19:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash -797292885, now seen corresponding path program 1 times [2024-11-14 05:19:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:19:52,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304082297] [2024-11-14 05:19:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:52,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:19:52,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:19:52,790 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:19:52,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-14 05:19:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:52,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 05:19:52,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:52,955 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 7 [2024-11-14 05:19:53,017 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:19:53,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:19:53,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:19:53,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:19:53,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:53,231 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:53,232 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 50 treesize of output 45 [2024-11-14 05:19:53,244 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 24 treesize of output 11 [2024-11-14 05:19:53,385 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:53,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:19:53,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:19:53,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:19:53,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:53,446 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 50 treesize of output 45 [2024-11-14 05:19:53,457 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 24 treesize of output 11 [2024-11-14 05:19:53,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:19:53,666 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 7 treesize of output 3 [2024-11-14 05:19:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:53,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:54,180 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_846) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:19:54,225 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_846) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2024-11-14 05:19:54,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_846) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-14 05:19:54,321 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_842))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_843) .cse0 v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_846) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_843) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))) is different from false [2024-11-14 05:19:54,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_843) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_842) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_842))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_843) .cse2 v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_846) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-14 05:19:54,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:54,555 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-14 05:19:54,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:54,567 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-14 05:19:54,571 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 84 treesize of output 72 [2024-11-14 05:19:54,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:54,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 131 [2024-11-14 05:19:54,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2024-11-14 05:19:54,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2024-11-14 05:19:54,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-14 05:19:54,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:54,793 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-14 05:19:54,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:54,813 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 05:19:54,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:19:54,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:19:54,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-14 05:19:54,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:19:54,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-14 05:19:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:55,113 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:19:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304082297] [2024-11-14 05:19:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304082297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:19:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1262049620] [2024-11-14 05:19:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:19:55,113 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:19:55,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:19:55,115 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:19:55,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 05:19:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:19:55,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:19:55,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:19:55,500 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 7 [2024-11-14 05:19:55,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:19:55,662 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:19:55,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:19:55,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:19:55,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:19:55,976 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:55,976 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 50 treesize of output 45 [2024-11-14 05:19:55,989 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 24 treesize of output 11 [2024-11-14 05:19:56,243 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:19:56,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:19:56,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:19:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:19:56,306 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:19:56,306 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 50 treesize of output 45 [2024-11-14 05:19:56,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 05:19:56,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:19:56,638 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 7 treesize of output 3 [2024-11-14 05:19:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:19:56,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:19:57,387 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-14 05:19:57,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-14 05:19:57,470 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_898))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_899) .cse0 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_899) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))) is different from false [2024-11-14 05:19:57,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_899) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_898) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_898))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_899) .cse2 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-14 05:19:57,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:57,628 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-14 05:19:57,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:57,639 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 05:19:57,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:57,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-11-14 05:19:57,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:57,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1831 treesize of output 1742 [2024-11-14 05:19:57,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-11-14 05:19:57,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 499 [2024-11-14 05:19:57,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 491 [2024-11-14 05:19:57,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:19:57,785 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 491 treesize of output 447 [2024-11-14 05:21:08,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:08,016 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-14 05:21:08,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:08,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-14 05:21:08,043 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 84 treesize of output 72 [2024-11-14 05:21:08,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:08,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 131 [2024-11-14 05:21:08,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2024-11-14 05:21:08,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2024-11-14 05:21:08,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-14 05:21:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:21:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1262049620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:21:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219427088] [2024-11-14 05:21:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:21:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:21:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:21:08,558 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:21:08,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 05:21:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:21:08,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 05:21:08,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:21:08,714 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 7 [2024-11-14 05:21:08,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:21:08,802 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:21:08,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:21:08,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:21:08,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:21:08,923 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:21:08,923 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 50 treesize of output 45 [2024-11-14 05:21:08,933 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 24 treesize of output 11 [2024-11-14 05:21:09,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:21:09,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:21:09,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:21:09,071 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:21:09,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 05:21:09,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:21:09,146 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 50 treesize of output 45 [2024-11-14 05:21:09,159 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 24 treesize of output 11 [2024-11-14 05:21:09,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:21:09,356 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 7 treesize of output 3 [2024-11-14 05:21:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:21:09,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:21:09,649 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-14 05:21:09,696 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:21:10,014 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_954) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_955))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_954) .cse1 v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_958) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-14 05:21:10,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_955))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_954) .cse1 v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_958) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_954) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_955) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-14 05:21:10,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:10,122 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-14 05:21:10,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:10,137 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 05:21:10,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-11-14 05:21:10,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:10,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1127 treesize of output 1070 [2024-11-14 05:21:10,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-11-14 05:21:10,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 515 [2024-11-14 05:21:10,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 491 [2024-11-14 05:21:10,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:21:10,289 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 491 treesize of output 447 [2024-11-14 05:22:15,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:15,738 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-14 05:22:15,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:15,751 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-14 05:22:15,759 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 84 treesize of output 72 [2024-11-14 05:22:15,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:15,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 131 [2024-11-14 05:22:15,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2024-11-14 05:22:15,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2024-11-14 05:22:15,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-14 05:22:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:22:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219427088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:16,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:22:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 12, 11, 12] total 39 [2024-11-14 05:22:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126225609] [2024-11-14 05:22:16,576 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:22:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-14 05:22:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:22:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-14 05:22:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=596, Unknown=32, NotChecked=806, Total=1560 [2024-11-14 05:22:16,578 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand has 40 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 40 states have internal predecessors, (136), 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 05:22:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:22:21,276 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2024-11-14 05:22:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:22:21,277 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 40 states have internal predecessors, (136), 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 43 [2024-11-14 05:22:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:22:21,278 INFO L225 Difference]: With dead ends: 312 [2024-11-14 05:22:21,278 INFO L226 Difference]: Without dead ends: 312 [2024-11-14 05:22:21,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 207 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=273, Invalid=1226, Unknown=35, NotChecked=1118, Total=2652 [2024-11-14 05:22:21,279 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 755 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 4721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3817 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:22:21,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 931 Invalid, 4721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 861 Invalid, 0 Unknown, 3817 Unchecked, 3.3s Time] [2024-11-14 05:22:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-14 05:22:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 207. [2024-11-14 05:22:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.2873563218390804) internal successors, (224), 205 states have internal predecessors, (224), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:22:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 232 transitions. [2024-11-14 05:22:21,285 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 232 transitions. Word has length 43 [2024-11-14 05:22:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:22:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 232 transitions. [2024-11-14 05:22:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 40 states have internal predecessors, (136), 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 05:22:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 232 transitions. [2024-11-14 05:22:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 05:22:21,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:22:21,286 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:22:21,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-14 05:22:21,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 05:22:21,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 05:22:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:22:21,887 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2024-11-14 05:22:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:22:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 366937066, now seen corresponding path program 1 times [2024-11-14 05:22:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:22:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631240513] [2024-11-14 05:22:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:22:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:22:21,890 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:22:21,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-14 05:22:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:22,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:22:22,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:22,078 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 7 [2024-11-14 05:22:22,171 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:22:22,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:22:22,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:22:22,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:22:22,399 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:22:22,400 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 41 treesize of output 38 [2024-11-14 05:22:22,409 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 24 treesize of output 11 [2024-11-14 05:22:22,593 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:22:22,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:22:22,637 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 05:22:22,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 05:22:22,729 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:22:22,730 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 60 treesize of output 53 [2024-11-14 05:22:22,738 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 11 [2024-11-14 05:22:22,747 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 24 treesize of output 11 [2024-11-14 05:22:23,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:22:23,070 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 7 treesize of output 3 [2024-11-14 05:22:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:22:23,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:23,567 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 69 treesize of output 49 [2024-11-14 05:22:23,713 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem5#1.base|)) (forall ((v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem5#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 05:22:23,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 05:22:23,767 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1010))) (= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1009))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_1015) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse2))))) is different from false [2024-11-14 05:22:23,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1009))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_1010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1010))) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1009) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1014) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-14 05:22:23,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:23,826 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2024-11-14 05:22:23,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:23,836 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-14 05:22:23,841 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 64 treesize of output 56 [2024-11-14 05:22:23,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:23,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 197 [2024-11-14 05:22:23,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2024-11-14 05:22:23,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2024-11-14 05:22:23,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:23,909 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 56 treesize of output 55 [2024-11-14 05:22:24,017 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:22:24,018 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-14 05:22:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:22:26,255 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:22:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631240513] [2024-11-14 05:22:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631240513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:22:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [375767572] [2024-11-14 05:22:26,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:22:26,255 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:22:26,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:22:26,257 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:22:26,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a414c7e-afe1-4ada-9e25-aea9590d768a/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-14 05:22:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:22:26,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 05:22:26,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:22:26,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2024-11-14 05:22:26,948 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2024-11-14 05:22:26,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 30 [2024-11-14 05:22:27,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:22:27,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:22:27,295 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 24 treesize of output 12 [2024-11-14 05:22:27,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:22:27,863 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:22:27,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 05:22:27,919 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 05:22:27,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-14 05:22:28,148 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:22:28,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-14 05:22:28,191 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:22:28,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-14 05:22:28,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:22:29,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:22:29,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-14 05:22:29,115 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 38 treesize of output 30 [2024-11-14 05:22:29,808 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2024-11-14 05:22:29,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 05:22:29,917 INFO L349 Elim1Store]: treesize reduction 22, result has 63.9 percent of original size [2024-11-14 05:22:29,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 76 [2024-11-14 05:22:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:22:29,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:22:30,536 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 90 treesize of output 63 [2024-11-14 05:22:31,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:31,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 144 [2024-11-14 05:22:32,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:22:32,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:22:32,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:22:32,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-14 05:22:32,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:32,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 227 [2024-11-14 05:22:34,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (and (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_209) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1066))) (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (select (select (store .cse9 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1066))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse10) (forall ((v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse10 (select (select (store .cse11 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd (_ bv8 32) .cse10) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse3 (forall ((v_arrayElimCell_208 (_ BitVec 32))) (not (= (bvadd (select |c_#valid| v_arrayElimCell_208) (_ bv1 1)) (_ bv0 1))))) (.cse0 (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1066) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (forall ((v_arrayElimCell_214 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_214))))))) (and (or .cse0 (forall ((v_ArrVal_1072 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_ArrVal_1072)))))) (or .cse1 .cse2 .cse3) (or .cse1 .cse4) (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_209) (_ bv1 1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_209) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1066))) (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (select (select (store .cse5 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1066))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (forall ((v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_209) (_ bv1 1)))) (= .cse6 (select (select (store .cse7 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse6) (= (bvadd (_ bv8 32) .cse6) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1066) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv0 32)))))) (or .cse8 .cse2 .cse3) (or .cse0 (forall ((v_ArrVal_1072 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1072) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_ArrVal_1072))))))) (or .cse8 .cse4))) is different from false [2024-11-14 05:22:34,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse7 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse5 (and (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_209) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1066))) (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (select (select (store .cse10 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1066))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse11 (select (select (store .cse12 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (bvadd .cse11 (_ bv8 32))))))))) (.cse6 (forall ((v_arrayElimCell_208 (_ BitVec 32))) (not (= (bvadd (select |c_#valid| v_arrayElimCell_208) (_ bv1 1)) (_ bv0 1))))) (.cse4 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse8 (forall ((v_arrayElimCell_214 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_214)))))) (.cse3 (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1066) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (_ bv8 32))))))) (and (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1066))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_209) (_ bv1 1)))) (= .cse0 (select (select (store .cse1 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (bvadd .cse0 (_ bv8 32))))))) (or .cse3 (forall ((v_ArrVal_1072 (_ BitVec 32))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_ArrVal_1072)))))) (or .cse4 .cse5 .cse6) (or .cse7 .cse8) (or (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1066) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv0 32)))))) (forall ((v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_209 (_ BitVec 32)) (v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_209) (_ bv1 1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_209) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1066))) (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) (select (select (store .cse9 v_arrayElimCell_209 v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse7 .cse5 .cse6) (or .cse4 .cse8) (or (forall ((v_ArrVal_1072 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1072) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_ArrVal_1072)))))) .cse3)))) is different from false [2024-11-14 05:22:34,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:34,547 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-14 05:22:34,551 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 37 treesize of output 29 [2024-11-14 05:22:34,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-14 05:22:34,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:34,586 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-14 05:22:34,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:22:34,626 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-14 05:22:34,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 61 [2024-11-14 05:22:34,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:34,672 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 50 treesize of output 50 [2024-11-14 05:22:34,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:34,757 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 51 [2024-11-14 05:22:34,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:34,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 156 [2024-11-14 05:22:34,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2024-11-14 05:22:34,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2024-11-14 05:22:35,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,005 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-14 05:22:35,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:22:35,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:22:35,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2024-11-14 05:22:35,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:22:35,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,069 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 51 [2024-11-14 05:22:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 280 [2024-11-14 05:22:35,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,120 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 134 treesize of output 126 [2024-11-14 05:22:35,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-14 05:22:35,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,251 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-14 05:22:35,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:22:35,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:22:35,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-14 05:22:35,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:22:35,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,297 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-14 05:22:35,302 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 37 treesize of output 29 [2024-11-14 05:22:35,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-14 05:22:35,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,329 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 51 [2024-11-14 05:22:35,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 167 [2024-11-14 05:22:35,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2024-11-14 05:22:35,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:35,432 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 126 treesize of output 118 [2024-11-14 05:22:36,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:22:36,106 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-14 05:22:36,115 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 33 treesize of output 25 [2024-11-14 05:22:36,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4