./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:35:28,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:35:28,480 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:35:28,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:35:28,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:35:28,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:35:28,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:35:28,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:35:28,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:35:28,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:35:28,515 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:35:28,515 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:35:28,515 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:35:28,515 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:35:28,515 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:35:28,515 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:35:28,516 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:35:28,516 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:35:28,516 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:35:28,516 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:35:28,516 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:35:28,516 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:35:28,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:35:28,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:35:28,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:35:28,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:35:28,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:35:28,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:35:28,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:35:28,519 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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-14 03:35:28,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:35:28,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:35:28,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:35:28,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:35:28,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:35:28,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i Unable to find full path for "g++" [2024-11-14 03:35:30,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:35:30,811 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:35:31,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:35:31,135 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-14 03:35:31,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data/ee4237ebc/fa8b285a9e7a42afae1434f2c07d0970/FLAG8d013c7d3 [2024-11-14 03:35:31,179 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data/ee4237ebc/fa8b285a9e7a42afae1434f2c07d0970 [2024-11-14 03:35:31,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:35:31,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:35:31,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:35:31,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:35:31,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:35:31,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc67258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31, skipping insertion in model container [2024-11-14 03:35:31,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:35:31,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:35:31,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:35:31,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:35:31,620 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:35:31,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31 WrapperNode [2024-11-14 03:35:31,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:35:31,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:35:31,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:35:31,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:35:31,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,660 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-14 03:35:31,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:35:31,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:35:31,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:35:31,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:35:31,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:35:31,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:35:31,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:35:31,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:35:31,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (1/1) ... [2024-11-14 03:35:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:35:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:31,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:35:31,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:35:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-14 03:35:31,771 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-14 03:35:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:35:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:35:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:35:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:35:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:35:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:35:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:35:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:35:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:35:31,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:35:31,906 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:35:31,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:35:31,932 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-14 03:35:32,273 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-14 03:35:32,273 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:35:32,324 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:35:32,324 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 03:35:32,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:35:32 BoogieIcfgContainer [2024-11-14 03:35:32,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:35:32,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:35:32,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:35:32,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:35:32,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:35:31" (1/3) ... [2024-11-14 03:35:32,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f1ff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:35:32, skipping insertion in model container [2024-11-14 03:35:32,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:35:31" (2/3) ... [2024-11-14 03:35:32,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f1ff15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:35:32, skipping insertion in model container [2024-11-14 03:35:32,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:35:32" (3/3) ... [2024-11-14 03:35:32,337 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-14 03:35:32,354 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:35:32,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 74 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2024-11-14 03:35:32,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:35:32,419 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;@426022ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:35:32,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-14 03:35:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:35:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:35:32,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:32,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:35:32,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:32,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash 176282, now seen corresponding path program 1 times [2024-11-14 03:35:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618098857] [2024-11-14 03:35:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:32,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:32,718 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 03:35:32,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618098857] [2024-11-14 03:35:32,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618098857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:32,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:32,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:35:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708739296] [2024-11-14 03:35:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:32,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:35:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:35:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:35:32,752 INFO L87 Difference]: Start difference. First operand has 73 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 03:35:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:32,896 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-11-14 03:35:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:35:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 03:35:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:32,905 INFO L225 Difference]: With dead ends: 68 [2024-11-14 03:35:32,905 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 03:35:32,907 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 03:35:32,913 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:32,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 73 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 03:35:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 03:35:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 2.0625) internal successors, (66), 62 states have internal predecessors, (66), 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 03:35:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-11-14 03:35:32,953 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 3 [2024-11-14 03:35:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:32,953 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-14 03:35:32,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 03:35:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-11-14 03:35:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:35:32,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:32,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:35:32,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:35:32,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 176283, now seen corresponding path program 1 times [2024-11-14 03:35:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845102093] [2024-11-14 03:35:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:33,096 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 03:35:33,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845102093] [2024-11-14 03:35:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845102093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:35:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110061441] [2024-11-14 03:35:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:35:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:33,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:35:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:35:33,102 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 03:35:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:33,215 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-14 03:35:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:35:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 03:35:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:33,216 INFO L225 Difference]: With dead ends: 65 [2024-11-14 03:35:33,217 INFO L226 Difference]: Without dead ends: 65 [2024-11-14 03:35:33,217 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 03:35:33,219 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:33,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-14 03:35:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2024-11-14 03:35:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 61 states have internal predecessors, (66), 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 03:35:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-14 03:35:33,228 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 3 [2024-11-14 03:35:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-14 03:35:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 03:35:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-14 03:35:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:35:33,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:33,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:35:33,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 209859048, now seen corresponding path program 1 times [2024-11-14 03:35:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473617470] [2024-11-14 03:35:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:33,365 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 03:35:33,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473617470] [2024-11-14 03:35:33,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473617470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:33,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:33,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:35:33,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263699017] [2024-11-14 03:35:33,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:33,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:35:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:35:33,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:35:33,371 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 03:35:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:33,454 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-14 03:35:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:35:33,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-14 03:35:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:33,456 INFO L225 Difference]: With dead ends: 60 [2024-11-14 03:35:33,456 INFO L226 Difference]: Without dead ends: 60 [2024-11-14 03:35:33,456 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 03:35:33,457 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:33,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-14 03:35:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-14 03:35:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 59 states have internal predecessors, (64), 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 03:35:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-14 03:35:33,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 8 [2024-11-14 03:35:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-14 03:35:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 03:35:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-14 03:35:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:35:33,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:33,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:33,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:35:33,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:33,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 209859049, now seen corresponding path program 1 times [2024-11-14 03:35:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483956360] [2024-11-14 03:35:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:33,654 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 03:35:33,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483956360] [2024-11-14 03:35:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483956360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:35:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220314130] [2024-11-14 03:35:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:35:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:35:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:35:33,657 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 03:35:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:33,765 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-14 03:35:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:35:33,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-14 03:35:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:33,767 INFO L225 Difference]: With dead ends: 58 [2024-11-14 03:35:33,769 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 03:35:33,770 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 03:35:33,770 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:33,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 03:35:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-14 03:35:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 57 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 03:35:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-11-14 03:35:33,781 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 8 [2024-11-14 03:35:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:33,781 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-14 03:35:33,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 03:35:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-11-14 03:35:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:35:33,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:33,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:35:33,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 209978693, now seen corresponding path program 1 times [2024-11-14 03:35:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469116451] [2024-11-14 03:35:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:33,873 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 03:35:33,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469116451] [2024-11-14 03:35:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469116451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:33,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:35:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361336234] [2024-11-14 03:35:33,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:33,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:35:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:33,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:35:33,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:35:33,875 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 03:35:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:33,918 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2024-11-14 03:35:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:35:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-14 03:35:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:33,919 INFO L225 Difference]: With dead ends: 63 [2024-11-14 03:35:33,919 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 03:35:33,920 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 03:35:33,921 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:33,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 95 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:35:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 03:35:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2024-11-14 03:35:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 56 states have internal predecessors, (60), 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 03:35:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2024-11-14 03:35:33,931 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 8 [2024-11-14 03:35:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:33,932 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2024-11-14 03:35:33,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 03:35:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2024-11-14 03:35:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:35:33,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:33,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:33,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:35:33,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:33,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash -188917364, now seen corresponding path program 1 times [2024-11-14 03:35:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265779236] [2024-11-14 03:35:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:34,313 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 03:35:34,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265779236] [2024-11-14 03:35:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265779236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:34,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:35:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198627517] [2024-11-14 03:35:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:34,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:35:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:35:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:35:34,315 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:35:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:34,527 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-11-14 03:35:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:35:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 03:35:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:34,531 INFO L225 Difference]: With dead ends: 60 [2024-11-14 03:35:34,532 INFO L226 Difference]: Without dead ends: 60 [2024-11-14 03:35:34,532 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 03:35:34,532 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:34,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:35:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-14 03:35:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-14 03:35:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 59 states have internal predecessors, (63), 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 03:35:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-11-14 03:35:34,540 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 10 [2024-11-14 03:35:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:34,540 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-11-14 03:35:34,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:35:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2024-11-14 03:35:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:35:34,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:34,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:34,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:35:34,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:34,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1626872657, now seen corresponding path program 1 times [2024-11-14 03:35:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239702392] [2024-11-14 03:35:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:34,647 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 03:35:34,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:34,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239702392] [2024-11-14 03:35:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239702392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:35:34,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768821999] [2024-11-14 03:35:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:34,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:34,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:34,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:35:34,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:35:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:34,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:35:34,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:35:34,819 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 03:35:34,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:35:34,856 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 03:35:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768821999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:35:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330667910] [2024-11-14 03:35:34,875 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-14 03:35:34,875 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:35:34,879 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:35:34,883 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:35:34,883 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:35:36,782 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:35:39,029 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '911#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) 1)) (exists ((|v_#memory_int_64| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_64| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |v_#memory_int_64| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))))) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |v_#memory_$Pointer$.base_68| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 0)))) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:35:39,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:35:39,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:35:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-14 03:35:39,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150985247] [2024-11-14 03:35:39,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:35:39,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:35:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:39,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:35:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=203, Unknown=1, NotChecked=0, Total=272 [2024-11-14 03:35:39,031 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 03:35:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:39,106 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-14 03:35:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:35:39,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 13 [2024-11-14 03:35:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:39,108 INFO L225 Difference]: With dead ends: 75 [2024-11-14 03:35:39,108 INFO L226 Difference]: Without dead ends: 75 [2024-11-14 03:35:39,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=68, Invalid=203, Unknown=1, NotChecked=0, Total=272 [2024-11-14 03:35:39,109 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 14 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:39,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 223 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-14 03:35:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-14 03:35:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.625) internal successors, (78), 70 states have internal predecessors, (78), 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 03:35:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-11-14 03:35:39,116 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 13 [2024-11-14 03:35:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:39,116 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-11-14 03:35:39,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 03:35:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-11-14 03:35:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:35:39,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:39,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:39,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:35:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:39,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -171506058, now seen corresponding path program 1 times [2024-11-14 03:35:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137590629] [2024-11-14 03:35:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:39,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137590629] [2024-11-14 03:35:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137590629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:35:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703113370] [2024-11-14 03:35:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:39,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:39,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:35:39,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:35:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:39,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:35:39,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:35:39,779 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 03:35:39,853 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:35:39,853 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 03:35:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:39,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:35:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703113370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:35:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608956179] [2024-11-14 03:35:40,036 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:35:40,038 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:35:40,039 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:35:40,039 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:35:40,039 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:35:41,234 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:35:48,634 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1159#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_83| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_83| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |ULTIMATE.start_dll_circular_create_~data#1|))) (= |v_#memory_int_83| (store |v_#memory_int_82| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) (select (select |v_#memory_int_83| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))))) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_42| Int) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_39| Int)) (and (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_42|) 11) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 5) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.base_86| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_42|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) (= |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_39| 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))' at error location [2024-11-14 03:35:48,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:35:48,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:35:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-14 03:35:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595166767] [2024-11-14 03:35:48,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:35:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:35:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:35:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=195, Unknown=3, NotChecked=0, Total=240 [2024-11-14 03:35:48,636 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:35:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:48,873 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-14 03:35:48,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:35:48,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:35:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:48,874 INFO L225 Difference]: With dead ends: 69 [2024-11-14 03:35:48,874 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 03:35:48,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=49, Invalid=220, Unknown=3, NotChecked=0, Total=272 [2024-11-14 03:35:48,875 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:48,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 125 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:35:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 03:35:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-14 03:35:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 68 states have internal predecessors, (74), 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 03:35:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-14 03:35:48,880 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 15 [2024-11-14 03:35:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:48,880 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-14 03:35:48,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:35:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-14 03:35:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:35:48,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:48,881 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:48,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:35:49,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:49,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash -171506059, now seen corresponding path program 1 times [2024-11-14 03:35:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:49,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949293998] [2024-11-14 03:35:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:49,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949293998] [2024-11-14 03:35:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949293998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:35:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401915093] [2024-11-14 03:35:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:49,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:49,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:35:49,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:35:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:49,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:35:49,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:35:49,379 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 03:35:49,432 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:35:49,432 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 03:35:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:49,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:35:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401915093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:35:49,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773811873] [2024-11-14 03:35:49,532 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:35:49,532 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:35:49,532 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:35:49,533 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:35:49,533 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:35:50,534 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:35:57,302 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1397#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 5) (exists ((|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_106| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_106| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_48| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_48|) 1)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_106| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.base_106| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_48|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))))) (= |ULTIMATE.start_main_~data_init~0#1| 1) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_103| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 1))) (= (store |v_#memory_int_102| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_102| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 (select (select |v_#memory_int_103| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4))) |v_#memory_int_103|))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:35:57,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:35:57,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:35:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-14 03:35:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101666650] [2024-11-14 03:35:57,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:35:57,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:35:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:35:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=136, Unknown=4, NotChecked=0, Total=182 [2024-11-14 03:35:57,304 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 03:35:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:57,533 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-11-14 03:35:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:35:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 15 [2024-11-14 03:35:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:57,534 INFO L225 Difference]: With dead ends: 67 [2024-11-14 03:35:57,534 INFO L226 Difference]: Without dead ends: 67 [2024-11-14 03:35:57,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=48, Invalid=158, Unknown=4, NotChecked=0, Total=210 [2024-11-14 03:35:57,535 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:57,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:35:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-14 03:35:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-14 03:35:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 states have internal predecessors, (70), 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 03:35:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-14 03:35:57,539 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 15 [2024-11-14 03:35:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:57,539 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-14 03:35:57,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 03:35:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-14 03:35:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:35:57,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:57,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:57,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:35:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:57,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1654581949, now seen corresponding path program 1 times [2024-11-14 03:35:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828723390] [2024-11-14 03:35:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:35:57,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:57,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828723390] [2024-11-14 03:35:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828723390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:35:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280812096] [2024-11-14 03:35:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:35:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:35:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:35:57,956 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 5 states, 4 states have (on average 4.25) 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 03:35:58,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:58,189 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-11-14 03:35:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:35:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) 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 29 [2024-11-14 03:35:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:58,190 INFO L225 Difference]: With dead ends: 64 [2024-11-14 03:35:58,190 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 03:35:58,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:35:58,191 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:58,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:35:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 03:35:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 03:35:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 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 03:35:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-14 03:35:58,195 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 29 [2024-11-14 03:35:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:58,195 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-14 03:35:58,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) 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 03:35:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-14 03:35:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:35:58,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:58,196 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:35:58,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1654581950, now seen corresponding path program 1 times [2024-11-14 03:35:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237273462] [2024-11-14 03:35:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:35:58,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237273462] [2024-11-14 03:35:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237273462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:58,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:58,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:35:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236333785] [2024-11-14 03:35:58,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:35:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:58,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:35:58,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:35:58,511 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 03:35:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:58,727 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-14 03:35:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:35:58,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 29 [2024-11-14 03:35:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:58,728 INFO L225 Difference]: With dead ends: 71 [2024-11-14 03:35:58,728 INFO L226 Difference]: Without dead ends: 71 [2024-11-14 03:35:58,729 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 03:35:58,729 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:58,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 117 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:35:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-14 03:35:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-14 03:35:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 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 03:35:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-14 03:35:58,732 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 29 [2024-11-14 03:35:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-14 03:35:58,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 03:35:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-14 03:35:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:35:58,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:58,734 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:35:58,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:35:58,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash -812322857, now seen corresponding path program 1 times [2024-11-14 03:35:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:58,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102614098] [2024-11-14 03:35:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:58,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:35:59,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:59,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102614098] [2024-11-14 03:35:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102614098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:35:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174980964] [2024-11-14 03:35:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:59,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:59,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:35:59,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:36:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:00,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 03:36:00,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:36:00,353 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:36:00,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 03:36:00,573 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 03:36:00,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-14 03:36:00,780 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-14 03:36:00,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2024-11-14 03:36:00,883 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 11 treesize of output 7 [2024-11-14 03:36:00,944 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 03:36:01,009 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 03:36:01,063 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 03:36:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:01,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:36:01,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2024-11-14 03:36:01,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:01,294 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 03:36:01,301 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 122 treesize of output 110 [2024-11-14 03:36:01,319 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 23 treesize of output 21 [2024-11-14 03:36:01,344 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 20 treesize of output 16 [2024-11-14 03:36:02,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:02,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 138 [2024-11-14 03:36:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-14 03:36:02,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174980964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:36:02,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1103319886] [2024-11-14 03:36:02,465 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:36:02,465 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:36:02,466 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:36:02,466 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:36:02,466 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:36:03,334 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:36:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1103319886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:36:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:36:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13, 14, 14] total 46 [2024-11-14 03:36:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334636901] [2024-11-14 03:36:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:36:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:36:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:36:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1812, Unknown=12, NotChecked=88, Total=2162 [2024-11-14 03:36:20,910 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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 03:36:22,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:24,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:29,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:31,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:33,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:35,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:37,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:39,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:41,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:48,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:49,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:56,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:58,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:00,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:02,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:04,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:06,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:08,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:11,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:13,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:16,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:37:17,532 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-11-14 03:37:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:37:17,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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 33 [2024-11-14 03:37:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:37:17,533 INFO L225 Difference]: With dead ends: 67 [2024-11-14 03:37:17,533 INFO L226 Difference]: Without dead ends: 67 [2024-11-14 03:37:17,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=290, Invalid=2051, Unknown=15, NotChecked=94, Total=2450 [2024-11-14 03:37:17,535 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:37:17,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 26 Unknown, 0 Unchecked, 45.3s Time] [2024-11-14 03:37:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-14 03:37:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-14 03:37:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 66 states have internal predecessors, (70), 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 03:37:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-14 03:37:17,539 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 33 [2024-11-14 03:37:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:37:17,539 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-14 03:37:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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 03:37:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-14 03:37:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:37:17,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:37:17,540 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:37:17,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:37:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 03:37:17,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:37:17,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:37:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash 588019521, now seen corresponding path program 1 times [2024-11-14 03:37:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:37:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827700349] [2024-11-14 03:37:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:37:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:37:18,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:37:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827700349] [2024-11-14 03:37:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827700349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:37:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:37:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:37:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677693595] [2024-11-14 03:37:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:37:18,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:37:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:37:18,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:37:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:37:18,021 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 03:37:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:37:18,420 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-11-14 03:37:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:37:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 34 [2024-11-14 03:37:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:37:18,421 INFO L225 Difference]: With dead ends: 69 [2024-11-14 03:37:18,421 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 03:37:18,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:37:18,422 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:37:18,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:37:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 03:37:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-11-14 03:37:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 64 states have internal predecessors, (68), 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 03:37:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-14 03:37:18,429 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 34 [2024-11-14 03:37:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:37:18,429 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-14 03:37:18,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 03:37:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-14 03:37:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:37:18,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:37:18,433 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:37:18,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:37:18,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:37:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:37:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 588019522, now seen corresponding path program 1 times [2024-11-14 03:37:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:37:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273681098] [2024-11-14 03:37:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:37:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:37:18,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:37:18,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273681098] [2024-11-14 03:37:18,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273681098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:37:18,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:37:18,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:37:18,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966065247] [2024-11-14 03:37:18,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:37:18,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:37:18,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:37:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:37:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:37:18,911 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 03:37:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:37:19,312 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-11-14 03:37:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:37:19,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 34 [2024-11-14 03:37:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:37:19,313 INFO L225 Difference]: With dead ends: 67 [2024-11-14 03:37:19,313 INFO L226 Difference]: Without dead ends: 67 [2024-11-14 03:37:19,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:37:19,314 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:37:19,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 103 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:37:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-14 03:37:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-14 03:37:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 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 03:37:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-11-14 03:37:19,317 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 34 [2024-11-14 03:37:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:37:19,318 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-14 03:37:19,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 03:37:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-11-14 03:37:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:37:19,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:37:19,323 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:37:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:37:19,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:37:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:37:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash 588019560, now seen corresponding path program 1 times [2024-11-14 03:37:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:37:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512405059] [2024-11-14 03:37:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:37:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:37:21,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:37:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512405059] [2024-11-14 03:37:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512405059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:37:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975637475] [2024-11-14 03:37:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:21,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:37:21,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:37:21,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:37:21,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:37:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:21,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 03:37:21,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:37:21,483 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 03:37:21,596 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:37:21,596 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 03:37:21,724 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 11 treesize of output 7 [2024-11-14 03:37:21,826 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 23 treesize of output 11 [2024-11-14 03:37:21,861 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:37:21,861 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 03:37:22,014 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:37:22,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-14 03:37:22,178 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:37:22,178 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 59 treesize of output 42 [2024-11-14 03:37:22,436 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:37:22,437 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 59 treesize of output 42 [2024-11-14 03:37:22,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:22,506 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 51 treesize of output 39 [2024-11-14 03:37:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:37:22,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:37:23,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:23,110 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 530 treesize of output 528 [2024-11-14 03:37:23,126 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 182 treesize of output 166 [2024-11-14 03:37:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:37:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975637475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:37:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [901846679] [2024-11-14 03:37:23,799 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:37:23,799 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:37:23,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:37:23,800 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:37:23,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:37:24,881 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:37:43,514 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2711#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_59| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~ptr~0#1.base_59|) 1))) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2024-11-14 03:37:43,514 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:37:43,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:37:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-11-14 03:37:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797878286] [2024-11-14 03:37:43,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:37:43,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 03:37:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:37:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 03:37:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1445, Unknown=12, NotChecked=0, Total=1640 [2024-11-14 03:37:43,516 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 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 03:37:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:37:45,490 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-14 03:37:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:37:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 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 34 [2024-11-14 03:37:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:37:45,492 INFO L225 Difference]: With dead ends: 73 [2024-11-14 03:37:45,492 INFO L226 Difference]: Without dead ends: 73 [2024-11-14 03:37:45,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=277, Invalid=1873, Unknown=12, NotChecked=0, Total=2162 [2024-11-14 03:37:45,494 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:37:45,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 218 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:37:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-14 03:37:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-11-14 03:37:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 64 states have internal predecessors, (70), 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 03:37:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2024-11-14 03:37:45,497 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 34 [2024-11-14 03:37:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:37:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-11-14 03:37:45,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 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 03:37:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2024-11-14 03:37:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:37:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:37:45,499 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:37:45,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:37:45,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:37:45,700 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:37:45,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:37:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash 588019561, now seen corresponding path program 1 times [2024-11-14 03:37:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:37:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410820484] [2024-11-14 03:37:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:37:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:37:48,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:37:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410820484] [2024-11-14 03:37:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410820484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:37:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116766719] [2024-11-14 03:37:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:37:48,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:37:48,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:37:48,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:37:48,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:37:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:37:48,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:37:48,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:37:49,046 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 03:37:49,054 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 03:37:49,395 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:37:49,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 03:37:49,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:37:49,443 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 03:37:49,648 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 11 treesize of output 7 [2024-11-14 03:37:49,687 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 11 treesize of output 7 [2024-11-14 03:37:49,826 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 23 treesize of output 11 [2024-11-14 03:37:49,862 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 23 treesize of output 11 [2024-11-14 03:37:49,937 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:37:49,937 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 61 treesize of output 54 [2024-11-14 03:37:49,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-14 03:37:50,146 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:37:50,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-14 03:37:50,181 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:37:50,181 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 03:37:50,430 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:37:50,431 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 66 treesize of output 49 [2024-11-14 03:37:50,445 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:37:50,445 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 69 treesize of output 71 [2024-11-14 03:37:50,768 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:37:50,769 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 66 treesize of output 49 [2024-11-14 03:37:50,784 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:37:50,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 74 [2024-11-14 03:37:50,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:50,881 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 58 treesize of output 46 [2024-11-14 03:37:50,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:50,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 45 [2024-11-14 03:37:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:37:51,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:37:51,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1605 Int) (v_ArrVal_1607 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1605)))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 4) (select |c_#length| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1607))) (store .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)))) (forall ((v_ArrVal_1605 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1605)))) (store .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) is different from false [2024-11-14 03:37:51,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1603 (Array Int Int))) (or (forall ((v_ArrVal_1604 (Array Int Int))) (or (forall ((v_ArrVal_1605 Int) (v_ArrVal_1607 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (<= (+ (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1604))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_ArrVal_1605))))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 4) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1603) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1607))) (store .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)))) (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1604 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1604)))) (not (= v_ArrVal_1603 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1603 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1604 (Array Int Int)) (v_ArrVal_1605 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (< 0 (+ (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1604))) (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_ArrVal_1605))))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 1)) (not (= (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1604 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1604)))))) is different from false [2024-11-14 03:37:51,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:51,868 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 891 treesize of output 887 [2024-11-14 03:37:52,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:52,399 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 1971 treesize of output 1967 [2024-11-14 03:37:52,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:37:52,475 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 4198 treesize of output 4172 [2024-11-14 03:37:52,518 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 302 treesize of output 286 [2024-11-14 03:37:55,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:55,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:55,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:55,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:55,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:55,985 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:55,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,097 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,097 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,101 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:37:56,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,218 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 53 treesize of output 49 [2024-11-14 03:37:56,286 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,291 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 76 [2024-11-14 03:37:56,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,368 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 53 treesize of output 49 [2024-11-14 03:37:56,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,501 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 53 treesize of output 49 [2024-11-14 03:37:56,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,542 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 53 treesize of output 49 [2024-11-14 03:37:56,586 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,697 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 204 treesize of output 196 [2024-11-14 03:37:56,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,856 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 67 treesize of output 59 [2024-11-14 03:37:56,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,911 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 03:37:56,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,926 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 03:37:56,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:56,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:56,980 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 62 treesize of output 54 [2024-11-14 03:37:57,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,080 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,375 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 295 treesize of output 287 [2024-11-14 03:37:57,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:37:57,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:37:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:38:00,447 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:38:00,447 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 200 treesize of output 1 [2024-11-14 03:38:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2024-11-14 03:38:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116766719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:38:00,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [137551453] [2024-11-14 03:38:00,451 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:38:00,451 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:38:00,451 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:38:00,451 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:38:00,451 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:38:01,545 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:38:14,677 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3107#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2024-11-14 03:38:14,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:38:14,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:38:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 32 [2024-11-14 03:38:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282318031] [2024-11-14 03:38:14,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:38:14,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:38:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:38:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1789, Unknown=8, NotChecked=174, Total=2162 [2024-11-14 03:38:14,679 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 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 03:38:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:38:16,935 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-14 03:38:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:38:16,936 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 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 34 [2024-11-14 03:38:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:38:16,937 INFO L225 Difference]: With dead ends: 72 [2024-11-14 03:38:16,937 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 03:38:16,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=8, NotChecked=202, Total=2862 [2024-11-14 03:38:16,938 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:38:16,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 461 Invalid, 0 Unknown, 102 Unchecked, 1.2s Time] [2024-11-14 03:38:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 03:38:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-14 03:38:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 states have internal predecessors, (72), 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 03:38:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-14 03:38:16,942 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 34 [2024-11-14 03:38:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:38:16,942 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-14 03:38:16,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 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 03:38:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-14 03:38:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:38:16,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:38:16,943 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:38:16,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 03:38:17,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 03:38:17,144 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:38:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:38:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1479940591, now seen corresponding path program 1 times [2024-11-14 03:38:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:38:17,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8203241] [2024-11-14 03:38:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:38:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:38:18,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:38:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8203241] [2024-11-14 03:38:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8203241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:38:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753421752] [2024-11-14 03:38:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:18,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:38:18,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:38:18,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:38:18,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:38:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:19,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:38:19,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:38:19,092 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 19 treesize of output 1 [2024-11-14 03:38:19,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:38:19,176 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 15 [2024-11-14 03:38:19,281 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 9 [2024-11-14 03:38:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-14 03:38:19,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:38:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753421752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:38:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:38:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 21 [2024-11-14 03:38:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944546672] [2024-11-14 03:38:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:38:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:38:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:38:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-14 03:38:19,330 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 03:38:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:38:19,848 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-11-14 03:38:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:38:19,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 37 [2024-11-14 03:38:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:38:19,850 INFO L225 Difference]: With dead ends: 75 [2024-11-14 03:38:19,850 INFO L226 Difference]: Without dead ends: 75 [2024-11-14 03:38:19,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-14 03:38:19,850 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:38:19,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 70 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:38:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-14 03:38:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-14 03:38:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 70 states have internal predecessors, (77), 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 03:38:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-11-14 03:38:19,855 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 37 [2024-11-14 03:38:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:38:19,855 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-11-14 03:38:19,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 03:38:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-11-14 03:38:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:38:19,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:38:19,856 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:38:19,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:38:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 03:38:20,057 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:38:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:38:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1479940590, now seen corresponding path program 1 times [2024-11-14 03:38:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:38:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303377823] [2024-11-14 03:38:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:38:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:38:21,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:38:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303377823] [2024-11-14 03:38:21,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303377823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:38:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176881601] [2024-11-14 03:38:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:21,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:38:21,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:38:21,506 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:38:21,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:38:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:21,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:38:21,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:38:21,805 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 03:38:21,922 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 03:38:21,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:38:21,944 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 03:38:22,031 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 13 treesize of output 9 [2024-11-14 03:38:22,103 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 25 treesize of output 13 [2024-11-14 03:38:22,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:38:22,150 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 31 treesize of output 32 [2024-11-14 03:38:22,254 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:38:22,254 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 18 [2024-11-14 03:38:22,271 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 4 [2024-11-14 03:38:22,382 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 40 treesize of output 24 [2024-11-14 03:38:22,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:38:22,597 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 25 treesize of output 13 [2024-11-14 03:38:22,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-14 03:38:22,816 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 28 treesize of output 10 [2024-11-14 03:38:22,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:38:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 03:38:22,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:38:23,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2120 (Array Int Int))) (or (forall ((v_ArrVal_2121 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (< (+ 3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (select |c_#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (forall ((v_ArrVal_2122 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2120) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2121) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2122) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2120 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2120)))) (or (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 1)) (forall ((v_ArrVal_2122 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2120 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2120) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2121) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2122) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2120 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2120))))))) is different from false [2024-11-14 03:38:23,901 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 151 treesize of output 149 [2024-11-14 03:38:23,908 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 62 treesize of output 58 [2024-11-14 03:38:23,922 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 44 treesize of output 36 [2024-11-14 03:38:23,959 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 151 treesize of output 149 [2024-11-14 03:38:23,966 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 62 treesize of output 58 [2024-11-14 03:38:23,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 8 treesize of output 4 [2024-11-14 03:38:23,987 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 4 [2024-11-14 03:38:24,119 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 35 treesize of output 33 [2024-11-14 03:38:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2024-11-14 03:38:24,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176881601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:38:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035204584] [2024-11-14 03:38:24,627 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:38:24,627 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:38:24,627 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:38:24,627 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:38:24,628 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:38:25,369 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:38:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2035204584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:38:50,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:38:50,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [13, 11, 13] total 55 [2024-11-14 03:38:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427447192] [2024-11-14 03:38:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:38:50,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 03:38:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 03:38:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2692, Unknown=14, NotChecked=106, Total=3080 [2024-11-14 03:38:50,182 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 03:38:52,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:54,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:57,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:04,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:13,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:15,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:17,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:19,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:22,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:24,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:27,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:29,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:31,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:33,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:35,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:38,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:40,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:41,141 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-11-14 03:39:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 03:39:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 37 [2024-11-14 03:39:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:41,143 INFO L225 Difference]: With dead ends: 74 [2024-11-14 03:39:41,144 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 03:39:41,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=360, Invalid=3285, Unknown=19, NotChecked=118, Total=3782 [2024-11-14 03:39:41,145 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 7 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 408 Invalid, 21 Unknown, 0 Unchecked, 38.8s Time] [2024-11-14 03:39:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 03:39:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-14 03:39:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.265625) internal successors, (81), 73 states have internal predecessors, (81), 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 03:39:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-11-14 03:39:41,150 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 37 [2024-11-14 03:39:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:41,151 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-11-14 03:39:41,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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 03:39:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-14 03:39:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 03:39:41,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:41,154 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:39:41,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:39:41,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 03:39:41,355 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:39:41,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1338388226, now seen corresponding path program 1 times [2024-11-14 03:39:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161881381] [2024-11-14 03:39:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:39:44,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161881381] [2024-11-14 03:39:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161881381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644743849] [2024-11-14 03:39:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:44,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:44,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:39:44,810 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:39:44,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:39:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:45,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-14 03:39:45,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:39:45,514 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:39:45,514 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 03:39:45,987 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-14 03:39:45,988 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 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-14 03:39:46,322 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 11 treesize of output 7 [2024-11-14 03:39:46,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:39:46,808 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-14 03:39:46,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-14 03:39:47,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 03:39:47,049 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 11 treesize of output 7 [2024-11-14 03:39:47,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:39:47,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:39:47,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:39:47,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:39:47,417 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:39:47,418 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2024-11-14 03:39:47,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-14 03:39:47,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 03:39:47,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-14 03:39:47,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:39:47,693 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 03:39:47,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:39:47,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-14 03:39:47,902 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 20 treesize of output 15 [2024-11-14 03:39:48,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:39:48,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-14 03:39:48,234 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 20 treesize of output 15 [2024-11-14 03:39:48,262 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 03:39:48,290 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 03:39:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:39:48,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:39:49,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2379 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2379) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2387) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2379 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2387) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2379) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-14 03:39:49,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2377 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2377 .cse1)) v_ArrVal_2377)) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2379 (Array Int Int)) (v_ArrVal_2378 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2387) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2378) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2379) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_2377 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2377 .cse1)) v_ArrVal_2377)) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2379 (Array Int Int)) (v_ArrVal_2378 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2378) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2379) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2387) .cse4) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) is different from false [2024-11-14 03:39:49,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2373 (Array Int Int))) (or (forall ((v_ArrVal_2374 (Array Int Int))) (or (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2375 (Array Int Int))) (or (not (= v_ArrVal_2377 (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2375) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_2377 .cse0)))) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2379 (Array Int Int)) (v_ArrVal_2378 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2373) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2378) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2379) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2387) .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2374 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2374)))) (not (= v_ArrVal_2373 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2373 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_2373 (Array Int Int))) (or (not (= v_ArrVal_2373 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2373 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2374 (Array Int Int))) (or (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2374 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2374)) (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2375 (Array Int Int))) (or (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2379 (Array Int Int)) (v_ArrVal_2378 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2381) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2387) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2373) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2378) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2379) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) .cse5)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse5)))) (not (= v_ArrVal_2377 (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2375) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_2377 .cse0)))))))))))) is different from false [2024-11-14 03:39:49,887 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 243 treesize of output 241 [2024-11-14 03:39:49,902 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 227 treesize of output 211 [2024-11-14 03:39:49,932 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 1030 treesize of output 1028 [2024-11-14 03:39:49,954 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 83 treesize of output 75 [2024-11-14 03:39:49,969 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 03:39:49,987 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 50 treesize of output 46 [2024-11-14 03:39:50,834 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 1 [2024-11-14 03:39:51,093 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 1 [2024-11-14 03:39:51,116 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 1 [2024-11-14 03:39:52,609 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 186 treesize of output 184 [2024-11-14 03:39:52,622 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 170 treesize of output 162 [2024-11-14 03:39:52,635 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 03:39:52,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1123 treesize of output 1121 [2024-11-14 03:39:52,666 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 142 treesize of output 126 [2024-11-14 03:39:52,679 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 72 [2024-11-14 03:39:52,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:39:52,724 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-14 03:39:52,737 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 85 treesize of output 73 [2024-11-14 03:39:53,438 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 1 [2024-11-14 03:39:53,825 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 1 [2024-11-14 03:39:53,848 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 1 [2024-11-14 03:40:05,221 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 1 [2024-11-14 03:40:05,264 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 1 [2024-11-14 03:40:05,302 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 1 [2024-11-14 03:40:05,329 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 1 [2024-11-14 03:40:05,351 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 1 [2024-11-14 03:40:05,386 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 1 [2024-11-14 03:40:05,460 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 1 [2024-11-14 03:40:05,510 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 1 [2024-11-14 03:40:05,539 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 1 [2024-11-14 03:40:48,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:40:48,470 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:40:48,471 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1044 treesize of output 1030 [2024-11-14 03:40:48,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:48,516 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 132 treesize of output 130 [2024-11-14 03:40:48,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:48,581 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 283 treesize of output 281 [2024-11-14 03:40:48,612 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 228 treesize of output 220 [2024-11-14 03:40:48,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:48,662 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 334 treesize of output 334 [2024-11-14 03:40:48,683 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 61 treesize of output 57 [2024-11-14 03:40:49,056 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 03:40:50,381 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 25 treesize of output 21 [2024-11-14 03:40:50,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:40:50,600 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:40:50,601 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1974 treesize of output 1960 [2024-11-14 03:40:50,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:40:50,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:50,669 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 221 treesize of output 219 [2024-11-14 03:40:50,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:50,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2024-11-14 03:40:50,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:50,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 189 [2024-11-14 03:40:50,797 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 98 [2024-11-14 03:40:52,138 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 03:40:52,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:52,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 80 [2024-11-14 03:40:53,158 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:40:53,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:40:53,435 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-14 03:40:53,436 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1277 treesize of output 1284 [2024-11-14 03:40:53,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:53,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 239 treesize of output 245 [2024-11-14 03:40:53,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:53,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 145 [2024-11-14 03:40:53,855 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-14 03:40:53,856 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 214 [2024-11-14 03:40:53,890 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 48 treesize of output 44 [2024-11-14 03:40:53,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:53,930 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2024-11-14 03:40:54,004 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 12 treesize of output 8 [2024-11-14 03:40:54,035 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 12 treesize of output 8 [2024-11-14 03:40:55,199 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 [2024-11-14 03:40:57,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:57,849 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 237 treesize of output 239 [2024-11-14 03:40:59,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:59,348 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2024-11-14 03:40:59,367 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 19 treesize of output 13 [2024-11-14 03:40:59,478 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 19 treesize of output 13 [2024-11-14 03:41:00,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:00,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 237 treesize of output 249 [2024-11-14 03:41:00,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:00,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 237 treesize of output 249 [2024-11-14 03:41:08,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:08,774 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 176 treesize of output 206 [2024-11-14 03:41:09,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:09,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:09,452 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:41:09,453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 158 [2024-11-14 03:41:09,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:09,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:09,514 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 65 treesize of output 67 [2024-11-14 03:41:09,643 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-14 03:41:09,643 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 74 [2024-11-14 03:41:09,920 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 03:41:09,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:09,950 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-14 03:41:09,977 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 19 treesize of output 13 [2024-11-14 03:41:10,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:10,038 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 32 treesize of output 36 [2024-11-14 03:41:10,120 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 17 treesize of output 13 [2024-11-14 03:41:10,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,177 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2024-11-14 03:41:10,177 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 1 [2024-11-14 03:41:10,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,255 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-14 03:41:10,255 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 143 [2024-11-14 03:41:10,263 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,265 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:10,291 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 51 treesize of output 53 [2024-11-14 03:41:10,303 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 25 treesize of output 23 [2024-11-14 03:41:10,363 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 03:41:10,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 6 treesize of output 4 [2024-11-14 03:41:10,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:10,528 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:41:10,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-14 03:41:10,551 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 228 treesize of output 212 [2024-11-14 03:41:10,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:10,608 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 213 treesize of output 211 [2024-11-14 03:41:10,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:10,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 205 [2024-11-14 03:41:10,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:10,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2024-11-14 03:41:10,731 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 6 treesize of output 4 [2024-11-14 03:41:11,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:11,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 140 [2024-11-14 03:41:12,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:12,539 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:41:12,539 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-14 03:41:12,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:12,627 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 221 treesize of output 219 [2024-11-14 03:41:12,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:12,675 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 213 treesize of output 213 [2024-11-14 03:41:12,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:12,720 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 191 treesize of output 189 [2024-11-14 03:41:12,742 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 98 [2024-11-14 03:41:12,763 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 [2024-11-14 03:41:14,234 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 37 treesize of output 31 [2024-11-14 03:41:14,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:41:14,546 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-14 03:41:14,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3896 treesize of output 3879 [2024-11-14 03:41:14,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:14,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 406 treesize of output 414 [2024-11-14 03:41:14,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:14,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 410 [2024-11-14 03:41:14,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:14,887 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 410 treesize of output 386 [2024-11-14 03:41:15,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:41:15,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 303 [2024-11-14 03:41:15,108 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 6 treesize of output 4 [2024-11-14 03:42:27,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:42:27,539 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 808 treesize of output 788 [2024-11-14 03:42:30,377 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 03:42:30,542 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 03:42:30,586 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 03:42:30,759 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 03:42:30,832 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 03:42:30,963 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 03:42:31,246 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 03:42:31,429 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 03:42:31,659 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 03:42:31,707 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 03:42:31,816 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 03:42:31,927 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 03:42:32,345 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 03:42:32,473 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 03:42:32,904 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 03:42:32,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-14 03:42:33,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-14 03:42:33,200 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 03:42:33,632 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 03:42:33,677 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 03:42:33,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-14 03:42:33,940 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 03:42:34,084 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 03:42:34,367 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 03:42:34,471 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 03:42:34,558 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 03:42:34,741 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 03:42:34,868 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 03:42:34,913 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:42:34,962 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:42:37,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 919 treesize of output 883 [2024-11-14 03:42:37,942 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:46:35,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-14 03:46:35,218 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:35,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619702204] [2024-11-14 03:46:35,220 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:46:35,221 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:46:35,221 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:46:35,221 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:46:35,221 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:46:35,226 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:35,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:46:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2024-11-14 03:46:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120013039] [2024-11-14 03:46:35,227 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 03:46:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 03:46:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 03:46:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1779, Unknown=42, NotChecked=264, Total=2256 [2024-11-14 03:46:35,230 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 20 states have internal predecessors, (38), 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 03:46:35,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=171, Invalid=1779, Unknown=42, NotChecked=264, Total=2256 [2024-11-14 03:46:35,232 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 03:46:35,232 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 03:46:35,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:46:35,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:35,433 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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:35,436 INFO L158 Benchmark]: Toolchain (without parser) took 664253.16ms. Allocated memory was 117.4MB in the beginning and 889.2MB in the end (delta: 771.8MB). Free memory was 93.4MB in the beginning and 400.6MB in the end (delta: -307.2MB). Peak memory consumption was 466.9MB. Max. memory is 16.1GB. [2024-11-14 03:46:35,436 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:46:35,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.93ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 76.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:46:35,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.86ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:46:35,438 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 73.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:46:35,438 INFO L158 Benchmark]: RCFGBuilder took 634.06ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 49.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:46:35,438 INFO L158 Benchmark]: TraceAbstraction took 663108.97ms. Allocated memory was 117.4MB in the beginning and 889.2MB in the end (delta: 771.8MB). Free memory was 49.2MB in the beginning and 400.6MB in the end (delta: -351.3MB). Peak memory consumption was 424.9MB. Max. memory is 16.1GB. [2024-11-14 03:46:35,440 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.93ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 76.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.86ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 73.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 634.06ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 49.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 663108.97ms. Allocated memory was 117.4MB in the beginning and 889.2MB in the end (delta: 771.8MB). Free memory was 49.2MB in the beginning and 400.6MB in the end (delta: -351.3MB). Peak memory consumption was 424.9MB. 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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:46:37,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:46:38,091 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:46:38,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:46:38,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:46:38,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:46:38,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:46:38,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:46:38,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:46:38,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:46:38,151 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:46:38,151 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:46:38,151 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:46:38,151 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:46:38,152 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:46:38,152 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:46:38,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:46:38,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:46:38,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:46:38,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:46:38,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:46:38,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:46:38,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:46:38,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:46:38,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:46:38,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:46:38,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:46:38,155 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:46:38,155 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:46:38,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:46:38,155 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:46:38,155 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_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-14 03:46:38,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:46:38,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:46:38,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:46:38,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:46:38,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:46:38,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i Unable to find full path for "g++" [2024-11-14 03:46:40,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:46:40,752 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:46:40,753 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-14 03:46:40,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data/ea4008fcb/e703234e194d4779a5b201a96fb0d542/FLAG63111cbee [2024-11-14 03:46:40,781 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/data/ea4008fcb/e703234e194d4779a5b201a96fb0d542 [2024-11-14 03:46:40,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:46:40,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:46:40,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:46:40,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:46:40,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:46:40,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:46:40" (1/1) ... [2024-11-14 03:46:40,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b56953b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:40, skipping insertion in model container [2024-11-14 03:46:40,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:46:40" (1/1) ... [2024-11-14 03:46:40,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:46:41,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:46:41,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:46:41,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:46:41,355 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:46:41,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41 WrapperNode [2024-11-14 03:46:41,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:46:41,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:46:41,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:46:41,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:46:41,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,414 INFO L138 Inliner]: procedures = 125, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-14 03:46:41,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:46:41,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:46:41,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:46:41,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:46:41,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:46:41,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:46:41,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:46:41,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:46:41,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (1/1) ... [2024-11-14 03:46:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:46:41,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:41,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:46:41,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:46:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-14 03:46:41,551 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-14 03:46:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:46:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:46:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:46:41,706 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:46:41,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:46:41,736 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-14 03:46:42,254 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-14 03:46:42,255 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:46:42,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:46:42,271 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 03:46:42,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:46:42 BoogieIcfgContainer [2024-11-14 03:46:42,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:46:42,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:46:42,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:46:42,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:46:42,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:46:40" (1/3) ... [2024-11-14 03:46:42,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af7d226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:46:42, skipping insertion in model container [2024-11-14 03:46:42,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:41" (2/3) ... [2024-11-14 03:46:42,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af7d226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:46:42, skipping insertion in model container [2024-11-14 03:46:42,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:46:42" (3/3) ... [2024-11-14 03:46:42,293 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-14 03:46:42,308 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:46:42,310 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 84 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2024-11-14 03:46:42,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:46:42,374 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;@4a30b8d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:46:42,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-14 03:46:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:46:42,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:42,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:46:42,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-14 03:46:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:42,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290244385] [2024-11-14 03:46:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:42,397 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 03:46:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:42,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:42,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:42,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:46:42,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:42,550 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 03:46:42,586 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 03:46:42,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:42,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:42,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290244385] [2024-11-14 03:46:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290244385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:42,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:42,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077109363] [2024-11-14 03:46:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:42,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:42,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:42,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:42,626 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:42,843 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-14 03:46:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:42,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:46:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:42,851 INFO L225 Difference]: With dead ends: 78 [2024-11-14 03:46:42,852 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 03:46:42,853 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 03:46:42,856 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:42,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 03:46:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-14 03:46:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.829268292682927) internal successors, (75), 71 states have internal predecessors, (75), 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 03:46:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-14 03:46:42,902 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2024-11-14 03:46:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:42,904 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-14 03:46:42,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 03:46:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-14 03:46:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:46:42,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:42,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:46:42,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:43,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-14 03:46:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:43,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207680441] [2024-11-14 03:46:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:43,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 03:46:43,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:43,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:43,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:46:43,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:43,206 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 03:46:43,242 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 03:46:43,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:43,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:43,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207680441] [2024-11-14 03:46:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207680441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610031803] [2024-11-14 03:46:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:43,246 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:43,448 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-14 03:46:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:43,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:46:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:43,450 INFO L225 Difference]: With dead ends: 68 [2024-11-14 03:46:43,450 INFO L226 Difference]: Without dead ends: 68 [2024-11-14 03:46:43,450 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 03:46:43,451 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:43,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-14 03:46:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-14 03:46:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 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 03:46:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-14 03:46:43,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 4 [2024-11-14 03:46:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:43,457 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-14 03:46:43,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 03:46:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-14 03:46:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:46:43,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:43,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:43,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:46:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash -401981421, now seen corresponding path program 1 times [2024-11-14 03:46:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722312242] [2024-11-14 03:46:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:43,660 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 03:46:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:43,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:43,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:46:43,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:43,778 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 03:46:43,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 03:46:43,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:43,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722312242] [2024-11-14 03:46:43,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722312242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:43,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:43,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667537637] [2024-11-14 03:46:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:43,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:43,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:43,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:43,798 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:43,970 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-11-14 03:46:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:43,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 03:46:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:43,971 INFO L225 Difference]: With dead ends: 66 [2024-11-14 03:46:43,972 INFO L226 Difference]: Without dead ends: 66 [2024-11-14 03:46:43,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 03:46:43,972 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:43,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-14 03:46:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-14 03:46:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 states have internal predecessors, (69), 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 03:46:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-14 03:46:43,985 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2024-11-14 03:46:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:43,986 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-14 03:46:43,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-14 03:46:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:46:43,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:43,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:43,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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)] Ended with exit code 0 [2024-11-14 03:46:44,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:44,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -401981420, now seen corresponding path program 1 times [2024-11-14 03:46:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519962278] [2024-11-14 03:46:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:44,188 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 03:46:44,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:44,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:44,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:46:44,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:44,317 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 03:46:44,338 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 03:46:44,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:44,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:44,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519962278] [2024-11-14 03:46:44,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519962278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:44,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:44,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968597802] [2024-11-14 03:46:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:44,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:44,342 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:44,520 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-14 03:46:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:44,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 03:46:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:44,522 INFO L225 Difference]: With dead ends: 64 [2024-11-14 03:46:44,522 INFO L226 Difference]: Without dead ends: 64 [2024-11-14 03:46:44,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 03:46:44,523 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:44,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-14 03:46:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-14 03:46:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 63 states have internal predecessors, (67), 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 03:46:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-14 03:46:44,528 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2024-11-14 03:46:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:44,528 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-14 03:46:44,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-14 03:46:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:46:44,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:44,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:44,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:44,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -401982862, now seen corresponding path program 1 times [2024-11-14 03:46:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000194637] [2024-11-14 03:46:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:44,731 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 03:46:44,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:44,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:44,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:46:44,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:44,855 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 03:46:44,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:44,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:44,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000194637] [2024-11-14 03:46:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000194637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:44,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:46:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486004306] [2024-11-14 03:46:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:44,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:44,856 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:44,875 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-11-14 03:46:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 03:46:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:44,876 INFO L225 Difference]: With dead ends: 72 [2024-11-14 03:46:44,876 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 03:46:44,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 03:46:44,877 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:44,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:46:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 03:46:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-11-14 03:46:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 64 states have internal predecessors, (68), 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 03:46:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-14 03:46:44,882 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2024-11-14 03:46:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:44,883 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-14 03:46:44,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-14 03:46:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:46:44,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:44,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:44,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:45,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash 242911479, now seen corresponding path program 1 times [2024-11-14 03:46:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402729900] [2024-11-14 03:46:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:45,085 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 03:46:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:45,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:45,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:46:45,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:45,224 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 03:46:45,335 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:46:45,335 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 03:46:45,381 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 03:46:45,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:45,382 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:45,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402729900] [2024-11-14 03:46:45,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402729900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:45,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:45,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:46:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838535329] [2024-11-14 03:46:45,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:45,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:45,383 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 03:46:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:45,673 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-14 03:46:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:46:45,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 03:46:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:45,675 INFO L225 Difference]: With dead ends: 69 [2024-11-14 03:46:45,675 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 03:46:45,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 03:46:45,676 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:45,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:46:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 03:46:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-14 03:46:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 states have internal predecessors, (73), 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 03:46:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-14 03:46:45,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2024-11-14 03:46:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:45,688 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-14 03:46:45,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 03:46:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-14 03:46:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:46:45,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:45,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:45,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:45,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 242911478, now seen corresponding path program 1 times [2024-11-14 03:46:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969053080] [2024-11-14 03:46:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:45,891 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 03:46:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:45,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:45,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:46,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:46:46,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:46,015 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 03:46:46,086 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:46:46,086 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 03:46:46,121 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 03:46:46,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:46,121 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:46,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969053080] [2024-11-14 03:46:46,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969053080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:46:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260156946] [2024-11-14 03:46:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:46,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:46,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:46,126 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 03:46:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:46,394 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-14 03:46:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:46:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 03:46:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:46,396 INFO L225 Difference]: With dead ends: 69 [2024-11-14 03:46:46,396 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 03:46:46,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 03:46:46,399 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:46,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 111 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:46:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 03:46:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-14 03:46:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 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 03:46:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-14 03:46:46,409 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 12 [2024-11-14 03:46:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:46,409 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-14 03:46:46,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 03:46:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-14 03:46:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:46:46,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:46,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:46,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:46:46,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:46,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -880163866, now seen corresponding path program 1 times [2024-11-14 03:46:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357829102] [2024-11-14 03:46:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:46,612 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 03:46:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:46,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:46,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:46,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:46:46,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:46,811 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 03:46:46,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:46,881 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 03:46:46,881 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357829102] [2024-11-14 03:46:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357829102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1956137954] [2024-11-14 03:46:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:46,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:46:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:46:46,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:46:46,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-14 03:46:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:47,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:46:47,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:47,150 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 03:46:47,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:47,197 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 03:46:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1956137954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147967765] [2024-11-14 03:46:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:47,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:46:47,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:46:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:47,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:46:47,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:47,336 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 03:46:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:47,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:47,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147967765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:47,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2024-11-14 03:46:47,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4, 4] total 8 [2024-11-14 03:46:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758777484] [2024-11-14 03:46:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:47,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:46:47,386 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 03:46:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:47,655 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-11-14 03:46:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:46:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 03:46:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:47,657 INFO L225 Difference]: With dead ends: 67 [2024-11-14 03:46:47,657 INFO L226 Difference]: Without dead ends: 67 [2024-11-14 03:46:47,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:47,659 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:47,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-14 03:46:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-14 03:46:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 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 03:46:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-14 03:46:47,664 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 16 [2024-11-14 03:46:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:47,664 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-14 03:46:47,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 03:46:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-14 03:46:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:46:47,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:47,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:47,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:47,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-14 03:46:48,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:46:48,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:48,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:48,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash -880163865, now seen corresponding path program 1 times [2024-11-14 03:46:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861849198] [2024-11-14 03:46:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:48,270 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 03:46:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:48,271 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:48,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:48,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:46:48,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:48,456 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 03:46:48,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:48,513 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 03:46:48,513 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861849198] [2024-11-14 03:46:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861849198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [117814570] [2024-11-14 03:46:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:48,514 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:46:48,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:46:48,516 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:46:48,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-14 03:46:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:48,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:46:48,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:48,783 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 03:46:48,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:48,828 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 03:46:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [117814570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713404281] [2024-11-14 03:46:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:48,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:48,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:48,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:46:48,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:46:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:48,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:46:48,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:48,997 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 03:46:48,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:49,080 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 03:46:49,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713404281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:49,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:46:49,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2024-11-14 03:46:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765585507] [2024-11-14 03:46:49,080 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:46:49,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:49,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:49,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:49,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:49,082 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 03:46:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:49,141 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-14 03:46:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:46:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 03:46:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:49,143 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:46:49,143 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:46:49,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:46:49,144 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:49,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 242 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:46:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:46:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-14 03:46:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 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 03:46:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-14 03:46:49,149 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 16 [2024-11-14 03:46:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-14 03:46:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 03:46:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-14 03:46:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:46:49,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:49,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:49,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:49,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 03:46:49,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-14 03:46:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:46:49,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 272467307, now seen corresponding path program 1 times [2024-11-14 03:46:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732475899] [2024-11-14 03:46:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:49,752 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 03:46:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:49,754 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:49,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:49,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:46:49,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:49,956 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 03:46:49,965 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 03:46:50,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:46:50,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:46:50,108 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:46:50,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 13 treesize of output 13 [2024-11-14 03:46:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:50,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:52,597 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732475899] [2024-11-14 03:46:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732475899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [650725157] [2024-11-14 03:46:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:46:52,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:46:52,601 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:46:52,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-14 03:46:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:52,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:46:52,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:52,886 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 03:46:52,893 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 03:46:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:46:52,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:46:52,982 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:46:52,982 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 03:46:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:53,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [650725157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376072672] [2024-11-14 03:46:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:53,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:53,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:53,292 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:46:53,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:46:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:53,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:46:53,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:53,438 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 03:46:53,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:46:53,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:46:53,542 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:46:53,542 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 03:46:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:53,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:53,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:46:53,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 65 [2024-11-14 03:46:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376072672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:53,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:46:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 5, 5] total 9 [2024-11-14 03:46:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355000378] [2024-11-14 03:46:53,916 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:46:53,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:46:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:53,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:46:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:46:53,917 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 03:46:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:54,607 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-14 03:46:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:46:54,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 03:46:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:54,608 INFO L225 Difference]: With dead ends: 79 [2024-11-14 03:46:54,608 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 03:46:54,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:46:54,609 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:54,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 03:46:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-14 03:46:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 78 states have internal predecessors, (82), 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 03:46:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-14 03:46:54,617 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2024-11-14 03:46:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:54,617 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-14 03:46:54,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 03:46:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-14 03:46:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:46:54,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:54,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:54,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:54,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 03:46:55,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-14 03:46:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:46:55,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1159414977, now seen corresponding path program 1 times [2024-11-14 03:46:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104333550] [2024-11-14 03:46:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:55,220 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 03:46:55,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:55,222 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:55,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:55,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:46:55,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:55,492 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 03:46:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 03:46:55,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:55,545 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104333550] [2024-11-14 03:46:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104333550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:55,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:46:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315092141] [2024-11-14 03:46:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:46:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:46:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:46:55,547 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:56,007 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-14 03:46:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:46:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-14 03:46:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:56,008 INFO L225 Difference]: With dead ends: 76 [2024-11-14 03:46:56,009 INFO L226 Difference]: Without dead ends: 76 [2024-11-14 03:46:56,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:56,009 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:56,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:46:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-14 03:46:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-14 03:46:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 75 states have internal predecessors, (80), 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 03:46:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-14 03:46:56,013 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2024-11-14 03:46:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:56,013 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-14 03:46:56,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-14 03:46:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:46:56,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:56,014 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:56,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:56,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:56,215 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1159414976, now seen corresponding path program 1 times [2024-11-14 03:46:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380227853] [2024-11-14 03:46:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:56,215 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 03:46:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:56,217 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:56,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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)] Waiting until timeout for monitored process [2024-11-14 03:46:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:56,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:46:56,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:56,529 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 03:46:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 03:46:56,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:56,642 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:46:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380227853] [2024-11-14 03:46:56,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380227853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:56,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:56,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:46:56,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768645281] [2024-11-14 03:46:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:56,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:46:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:46:56,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:46:56,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:46:56,646 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:57,161 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-14 03:46:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:46:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-14 03:46:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:57,162 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:46:57,162 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:46:57,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:57,163 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:57,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:46:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:46:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-14 03:46:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 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 03:46:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-14 03:46:57,169 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2024-11-14 03:46:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:57,169 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-14 03:46:57,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-14 03:46:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:46:57,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:57,171 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:57,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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)] Ended with exit code 0 [2024-11-14 03:46:57,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:57,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:46:57,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -140857511, now seen corresponding path program 1 times [2024-11-14 03:46:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:46:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641175412] [2024-11-14 03:46:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:57,373 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 03:46:57,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:46:57,374 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:46:57,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 (20)] Waiting until timeout for monitored process [2024-11-14 03:46:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:57,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 03:46:57,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:57,871 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 03:46:57,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:46:58,023 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:46:58,023 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 18 treesize of output 28 [2024-11-14 03:46:58,248 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2024-11-14 03:46:58,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-11-14 03:46:58,322 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 11 treesize of output 7 [2024-11-14 03:46:58,382 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 03:46:58,484 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 03:46:58,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:46:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:58,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:58,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_940) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-14 03:46:58,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_939) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_940) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-14 03:46:58,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:46:58,871 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 03:46:58,875 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 60 treesize of output 52 [2024-11-14 03:46:58,885 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 24 treesize of output 22 [2024-11-14 03:46:58,888 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 46 treesize of output 42 [2024-11-14 03:47:02,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:02,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 113 treesize of output 135 [2024-11-14 03:47:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 03:47:02,676 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:47:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641175412] [2024-11-14 03:47:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641175412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [941013144] [2024-11-14 03:47:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:02,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:47:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:47:02,678 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:47:02,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 03:47:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:03,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:47:03,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:03,391 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-14 03:47:03,392 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 21 treesize of output 20 [2024-11-14 03:47:03,464 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:47:03,465 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 03:47:03,717 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-14 03:47:03,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 03:47:03,868 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 11 treesize of output 7 [2024-11-14 03:47:03,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:47:04,031 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 03:47:04,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:47:04,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:04,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1058) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2024-11-14 03:47:04,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:04,305 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 03:47:04,307 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 60 treesize of output 52 [2024-11-14 03:47:04,311 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 48 treesize of output 44 [2024-11-14 03:47:04,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 22 treesize of output 20 [2024-11-14 03:47:19,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:19,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 135 treesize of output 329 [2024-11-14 03:47:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-14 03:47:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [941013144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917419734] [2024-11-14 03:47:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:20,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:20,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:47:20,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:47:20,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:47:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:20,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 03:47:20,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:21,225 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:47:21,225 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 03:47:21,334 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 11 treesize of output 7 [2024-11-14 03:47:21,425 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 03:47:21,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:21,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:21,858 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 03:47:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:47:21,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:22,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1173))) (or (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1174) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_1174 .cse1))) v_ArrVal_1174))))) is different from false [2024-11-14 03:47:22,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:22,497 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 48 treesize of output 40 [2024-11-14 03:47:22,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:22,515 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 160 treesize of output 160 [2024-11-14 03:47:25,369 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-14 03:47:25,370 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 76 [2024-11-14 03:47:25,440 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 1 [2024-11-14 03:47:25,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:25,520 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 49 treesize of output 53 [2024-11-14 03:47:25,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:25,635 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 45 treesize of output 49 [2024-11-14 03:47:26,445 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-14 03:47:26,445 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 76 [2024-11-14 03:47:26,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:26,471 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 26 treesize of output 30 [2024-11-14 03:47:26,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:26,511 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 26 treesize of output 30 [2024-11-14 03:47:26,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 65 treesize of output 59 [2024-11-14 03:47:26,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:26,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 57 [2024-11-14 03:47:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2024-11-14 03:47:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917419734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:27,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:47:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 15, 16, 13, 13] total 60 [2024-11-14 03:47:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25167665] [2024-11-14 03:47:27,192 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:47:27,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-14 03:47:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:47:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-14 03:47:27,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2748, Unknown=85, NotChecked=444, Total=3540 [2024-11-14 03:47:27,196 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 60 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 60 states have internal predecessors, (164), 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 03:47:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:30,782 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-14 03:47:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:47:30,783 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 60 states have internal predecessors, (164), 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 03:47:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:30,784 INFO L225 Difference]: With dead ends: 79 [2024-11-14 03:47:30,784 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 03:47:30,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=540, Invalid=3811, Unknown=87, NotChecked=532, Total=4970 [2024-11-14 03:47:30,787 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:30,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1211 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 854 Invalid, 0 Unknown, 120 Unchecked, 2.6s Time] [2024-11-14 03:47:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 03:47:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-14 03:47:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 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 03:47:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-14 03:47:30,789 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 41 [2024-11-14 03:47:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:30,790 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-14 03:47:30,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 60 states have internal predecessors, (164), 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 03:47:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-14 03:47:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:47:30,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:30,791 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:30,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-14 03:47:31,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 03:47:31,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 (20)] Ended with exit code 0 [2024-11-14 03:47:31,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:31,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:47:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2079601737, now seen corresponding path program 1 times [2024-11-14 03:47:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:47:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325976516] [2024-11-14 03:47:31,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:31,393 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 03:47:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:47:31,395 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:31,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 (23)] Waiting until timeout for monitored process [2024-11-14 03:47:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:31,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:47:31,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:31,646 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 03:47:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 03:47:31,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:47:31,732 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:47:31,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325976516] [2024-11-14 03:47:31,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325976516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:47:31,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:47:31,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:47:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901328700] [2024-11-14 03:47:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:47:31,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:47:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:47:31,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:47:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:47:31,733 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 03:47:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:32,292 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-11-14 03:47:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:47:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 03:47:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:32,293 INFO L225 Difference]: With dead ends: 81 [2024-11-14 03:47:32,293 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 03:47:32,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:47:32,294 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:32,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 118 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:47:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 03:47:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-14 03:47:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.25) internal successors, (80), 76 states have internal predecessors, (80), 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 03:47:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-14 03:47:32,297 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2024-11-14 03:47:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:32,297 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-14 03:47:32,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 03:47:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-14 03:47:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:47:32,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:32,298 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:32,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 (23)] Ended with exit code 0 [2024-11-14 03:47:32,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:32,499 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:47:32,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2079601738, now seen corresponding path program 1 times [2024-11-14 03:47:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:47:32,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132099107] [2024-11-14 03:47:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:32,499 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 03:47:32,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:47:32,503 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:32,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:32,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:47:32,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:32,774 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 03:47:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 03:47:32,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:47:32,910 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:47:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132099107] [2024-11-14 03:47:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132099107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:47:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:47:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:47:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455850828] [2024-11-14 03:47:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:47:32,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:47:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:47:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:47:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:47:32,911 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 03:47:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:33,484 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-11-14 03:47:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:47:33,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 03:47:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:33,485 INFO L225 Difference]: With dead ends: 79 [2024-11-14 03:47:33,486 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 03:47:33,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:47:33,486 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:33,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 148 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:47:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 03:47:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-11-14 03:47:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.21875) internal successors, (78), 74 states have internal predecessors, (78), 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 03:47:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-14 03:47:33,489 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2024-11-14 03:47:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:33,490 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-14 03:47:33,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 03:47:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-14 03:47:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:47:33,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:33,490 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:33,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:33,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:33,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:47:33,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2079601776, now seen corresponding path program 1 times [2024-11-14 03:47:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:47:33,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607799166] [2024-11-14 03:47:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:33,692 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 03:47:33,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:47:33,693 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:33,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:34,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:47:34,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:34,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:47:34,274 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:47:34,274 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 03:47:34,348 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 11 treesize of output 7 [2024-11-14 03:47:34,402 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 23 treesize of output 11 [2024-11-14 03:47:34,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:34,445 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 03:47:34,571 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:47:34,571 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 31 treesize of output 30 [2024-11-14 03:47:34,675 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:47:34,675 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 67 treesize of output 54 [2024-11-14 03:47:35,035 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:47:35,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2024-11-14 03:47:35,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:35,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 46 [2024-11-14 03:47:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:47:35,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:36,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:36,180 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 2 case distinctions, treesize of input 55 treesize of output 48 [2024-11-14 03:47:36,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:36,207 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 392 treesize of output 382 [2024-11-14 03:47:36,227 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 202 treesize of output 186 [2024-11-14 03:47:36,446 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 65 treesize of output 57 [2024-11-14 03:47:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:47:40,944 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:47:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607799166] [2024-11-14 03:47:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607799166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1081919344] [2024-11-14 03:47:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:40,945 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:47:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:47:40,947 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:47:40,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 03:47:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:41,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 03:47:41,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:41,591 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 03:47:41,651 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:47:41,651 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 03:47:41,700 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 11 treesize of output 7 [2024-11-14 03:47:41,725 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 23 treesize of output 11 [2024-11-14 03:47:41,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:41,765 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 03:47:41,833 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:47:41,833 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 31 treesize of output 30 [2024-11-14 03:47:41,908 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:47:41,909 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 67 treesize of output 54 [2024-11-14 03:47:42,124 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:47:42,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2024-11-14 03:47:42,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:42,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 46 [2024-11-14 03:47:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:47:42,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:42,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:42,869 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 2 case distinctions, treesize of input 55 treesize of output 48 [2024-11-14 03:47:42,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:42,892 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 196 treesize of output 194 [2024-11-14 03:47:42,904 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 202 treesize of output 186 [2024-11-14 03:47:43,112 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 65 treesize of output 57 [2024-11-14 03:47:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:47:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1081919344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564354682] [2024-11-14 03:47:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:43,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:43,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:47:43,390 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:47:43,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 03:47:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:43,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:47:43,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:43,741 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 03:47:43,777 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:47:43,777 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 03:47:43,860 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 11 treesize of output 7 [2024-11-14 03:47:43,947 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 23 treesize of output 11 [2024-11-14 03:47:43,977 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:43,978 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 03:47:44,179 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:47:44,179 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 31 treesize of output 30 [2024-11-14 03:47:44,361 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:47:44,361 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 67 treesize of output 54 [2024-11-14 03:47:44,915 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:47:44,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 63 [2024-11-14 03:47:44,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:44,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 53 [2024-11-14 03:47:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:47:45,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:45,412 INFO L349 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2024-11-14 03:47:45,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 68 [2024-11-14 03:47:45,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_ArrVal_1796 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1796)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) is different from false [2024-11-14 03:47:45,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1795 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ BitVec 32)) (v_ArrVal_1796 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1795)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1796)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2024-11-14 03:47:45,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:45,520 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 2 case distinctions, treesize of input 77 treesize of output 56 [2024-11-14 03:47:45,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:45,538 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 273 treesize of output 263 [2024-11-14 03:47:45,548 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 83 treesize of output 67 [2024-11-14 03:47:45,568 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 4 [2024-11-14 03:47:45,581 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 51 treesize of output 43 [2024-11-14 03:47:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2024-11-14 03:47:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564354682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:49,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:47:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14, 13, 14, 13] total 42 [2024-11-14 03:47:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422040119] [2024-11-14 03:47:49,875 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:47:49,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:47:49,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:47:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:47:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1464, Unknown=13, NotChecked=158, Total=1806 [2024-11-14 03:47:49,877 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 43 states have internal predecessors, (104), 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 03:47:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:53,919 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-14 03:47:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:47:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 43 states have internal predecessors, (104), 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 03:47:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:53,920 INFO L225 Difference]: With dead ends: 86 [2024-11-14 03:47:53,920 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 03:47:53,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 206 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=249, Invalid=1908, Unknown=13, NotChecked=182, Total=2352 [2024-11-14 03:47:53,921 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:53,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 362 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 860 Invalid, 0 Unknown, 132 Unchecked, 3.3s Time] [2024-11-14 03:47:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 03:47:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-14 03:47:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 77 states have internal predecessors, (83), 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 03:47:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-14 03:47:53,927 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2024-11-14 03:47:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-14 03:47:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 43 states have internal predecessors, (104), 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 03:47:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-14 03:47:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:47:53,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:53,928 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:53,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 03:47:54,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 03:47:54,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:54,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:54,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:47:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2079601777, now seen corresponding path program 1 times [2024-11-14 03:47:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:47:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394160608] [2024-11-14 03:47:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:54,530 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 03:47:54,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:47:54,531 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:54,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:47:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:54,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:47:54,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:55,014 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 03:47:55,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:47:55,090 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:47:55,090 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 18 treesize of output 28 [2024-11-14 03:47:55,111 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 03:47:55,293 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:47:55,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 03:47:55,324 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2024-11-14 03:47:55,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-11-14 03:47:55,384 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 11 treesize of output 7 [2024-11-14 03:47:55,400 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 11 treesize of output 7 [2024-11-14 03:47:55,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:55,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:55,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:55,496 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 03:47:55,507 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 24 treesize of output 11 [2024-11-14 03:47:55,618 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 03:47:55,629 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 26 treesize of output 19 [2024-11-14 03:47:55,644 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 33 treesize of output 17 [2024-11-14 03:47:55,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:55,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:55,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-14 03:47:55,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:55,943 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 33 treesize of output 17 [2024-11-14 03:47:55,949 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 03:47:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:56,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:57,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1932) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:47:57,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1932) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:47:57,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1927 (_ BitVec 32)) (v_ArrVal_1929 (_ BitVec 32)) (v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1929)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1927)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1932) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (_ BitVec 32)) (v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1929)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32))))))) is different from false [2024-11-14 03:47:57,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:57,179 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 2 case distinctions, treesize of input 57 treesize of output 63 [2024-11-14 03:47:57,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:57,197 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 2 case distinctions, treesize of input 44 treesize of output 50 [2024-11-14 03:47:57,202 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 134 treesize of output 122 [2024-11-14 03:47:57,207 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 392 treesize of output 362 [2024-11-14 03:47:57,217 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 44 treesize of output 40 [2024-11-14 03:47:57,224 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 40 treesize of output 36 [2024-11-14 03:47:57,227 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 74 treesize of output 66 [2024-11-14 03:47:57,230 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 58 [2024-11-14 03:47:57,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:57,343 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 2 case distinctions, treesize of input 55 treesize of output 48 [2024-11-14 03:47:57,356 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 192 treesize of output 162 [2024-11-14 03:47:57,362 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 36 treesize of output 20 [2024-11-14 03:47:57,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 13 treesize of output 5 [2024-11-14 03:47:58,339 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-14 03:47:58,340 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 16 treesize of output 15 [2024-11-14 03:47:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-14 03:47:58,351 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:47:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394160608] [2024-11-14 03:47:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394160608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [481189729] [2024-11-14 03:47:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:58,351 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:47:58,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:47:58,355 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:47:58,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 03:47:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:59,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 03:47:59,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:59,280 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 03:47:59,285 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 03:47:59,582 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:47:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 03:47:59,612 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:47:59,612 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 03:47:59,744 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 11 treesize of output 7 [2024-11-14 03:47:59,752 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 11 treesize of output 7 [2024-11-14 03:47:59,875 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 23 treesize of output 11 [2024-11-14 03:47:59,895 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 23 treesize of output 11 [2024-11-14 03:47:59,939 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:59,939 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 03:47:59,944 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 03:48:00,218 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:48:00,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-14 03:48:00,270 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:48:00,270 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 18 [2024-11-14 03:48:00,448 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:48:00,448 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 03:48:00,466 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:48:00,466 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 63 treesize of output 50 [2024-11-14 03:48:01,239 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:48:01,240 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 03:48:01,251 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:48:01,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 59 [2024-11-14 03:48:01,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:01,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 49 [2024-11-14 03:48:01,343 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:48:01,343 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 15 treesize of output 7 [2024-11-14 03:48:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:48:01,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:48:04,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2068 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))))) (forall ((v_ArrVal_2068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select |c_#length| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (bvule .cse3 (bvadd (_ bv4 32) .cse3)) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((v_ArrVal_2068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-14 03:48:04,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2064 (_ BitVec 32)) (v_ArrVal_2067 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2064)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2067)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| .cse0)))))) (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2064 (_ BitVec 32)) (v_ArrVal_2067 (_ BitVec 32))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2067)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2068 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse4 (_ bv4 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2064)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))))) (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2067 (_ BitVec 32))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2067)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (bvule .cse5 (bvadd .cse5 (_ bv4 32))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or (forall ((v_ArrVal_2068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2064 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2064)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2068) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_2069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2067 (_ BitVec 32))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2067)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (bvule .cse6 (bvadd .cse6 (_ bv4 32)))))))) is different from false [2024-11-14 03:48:04,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:04,699 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 2 case distinctions, treesize of input 77 treesize of output 69 [2024-11-14 03:48:04,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:04,718 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 2 case distinctions, treesize of input 38 treesize of output 44 [2024-11-14 03:48:04,726 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 62 treesize of output 50 [2024-11-14 03:48:04,729 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 121 treesize of output 97 [2024-11-14 03:48:04,749 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 03:48:04,754 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 27 treesize of output 19 [2024-11-14 03:48:04,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:04,812 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 2 case distinctions, treesize of input 51 treesize of output 57 [2024-11-14 03:48:04,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:04,838 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 2 case distinctions, treesize of input 64 treesize of output 56 [2024-11-14 03:48:04,848 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 87 treesize of output 69 [2024-11-14 03:48:04,858 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 96 treesize of output 78 [2024-11-14 03:48:04,870 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 31 treesize of output 23 [2024-11-14 03:48:04,876 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 15 treesize of output 11 [2024-11-14 03:48:04,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:04,918 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 2 case distinctions, treesize of input 75 treesize of output 54 [2024-11-14 03:48:04,926 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 75 treesize of output 51 [2024-11-14 03:48:04,953 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 29 treesize of output 17 [2024-11-14 03:48:04,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:04,994 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 2 case distinctions, treesize of input 49 treesize of output 42 [2024-11-14 03:48:05,003 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 32 [2024-11-14 03:48:05,007 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 13 treesize of output 5 [2024-11-14 03:48:05,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:05,041 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 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-14 03:48:05,053 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 36 treesize of output 24 [2024-11-14 03:48:05,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:48:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2024-11-14 03:48:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [481189729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:48:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175278832] [2024-11-14 03:48:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:48:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:48:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:48:05,972 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:48:05,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 03:48:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:48:06,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 03:48:06,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:48:06,286 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 03:48:06,487 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:48:06,487 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 03:48:06,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:48:06,525 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 11 treesize of output 7 [2024-11-14 03:48:06,544 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 11 treesize of output 7 [2024-11-14 03:48:06,567 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 23 treesize of output 11 [2024-11-14 03:48:06,575 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 23 treesize of output 11 [2024-11-14 03:48:06,599 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:48:06,600 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 03:48:06,607 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 03:48:06,692 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 03:48:06,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-14 03:48:06,734 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:48:06,734 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 18 [2024-11-14 03:48:06,867 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:48:06,868 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 63 treesize of output 50 [2024-11-14 03:48:06,898 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:48:06,898 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 03:48:07,155 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:48:07,155 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 03:48:07,165 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:48:07,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 59 [2024-11-14 03:48:07,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:07,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 49 [2024-11-14 03:48:07,249 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:48:07,249 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 15 treesize of output 7 [2024-11-14 03:48:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:48:07,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:48:08,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or (forall ((v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_2206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (bvule .cse2 (bvadd (_ bv4 32) .cse2)) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select |c_#length| .cse3)) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_ArrVal_2206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (bvule (bvadd (_ bv4 32) .cse4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2024-11-14 03:48:08,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2204 (_ BitVec 32)) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2204)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (or (forall ((v_ArrVal_2204 (_ BitVec 32)) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2204)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_2205 (_ BitVec 32)) (v_ArrVal_2206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2205)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2205 (_ BitVec 32)) (v_ArrVal_2204 (_ BitVec 32)) (v_ArrVal_2206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2205)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2204)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (select |c_#length| .cse5))))) (forall ((v_ArrVal_2205 (_ BitVec 32)) (v_ArrVal_2204 (_ BitVec 32)) (v_ArrVal_2206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2204)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (bvule (bvadd (_ bv4 32) .cse6) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2205)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))))))) is different from false [2024-11-14 03:48:08,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:08,667 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 2 case distinctions, treesize of input 51 treesize of output 57 [2024-11-14 03:48:08,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:08,684 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 2 case distinctions, treesize of input 64 treesize of output 56 [2024-11-14 03:48:08,689 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 87 treesize of output 69 [2024-11-14 03:48:08,696 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 96 treesize of output 78 [2024-11-14 03:48:08,698 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 31 treesize of output 23 [2024-11-14 03:48:08,701 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 15 treesize of output 11 [2024-11-14 03:48:08,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:08,742 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 2 case distinctions, treesize of input 77 treesize of output 69 [2024-11-14 03:48:08,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:08,762 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 2 case distinctions, treesize of input 38 treesize of output 44 [2024-11-14 03:48:08,771 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 62 treesize of output 50 [2024-11-14 03:48:08,779 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 121 treesize of output 97 [2024-11-14 03:48:08,792 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 15 treesize of output 11 [2024-11-14 03:48:08,796 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 11 [2024-11-14 03:48:08,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:08,821 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 2 case distinctions, treesize of input 49 treesize of output 42 [2024-11-14 03:48:08,829 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 32 [2024-11-14 03:48:08,845 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 13 treesize of output 5 [2024-11-14 03:48:08,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:08,869 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 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-14 03:48:08,879 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 36 treesize of output 24 [2024-11-14 03:48:08,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:48:08,902 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:48:08,902 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 2 case distinctions, treesize of input 75 treesize of output 1 [2024-11-14 03:48:09,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:09,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 60 [2024-11-14 03:48:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2024-11-14 03:48:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175278832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:48:09,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:48:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 15, 13, 16, 14] total 58 [2024-11-14 03:48:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636893798] [2024-11-14 03:48:09,508 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:48:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-14 03:48:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:48:09,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-14 03:48:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2470, Unknown=16, NotChecked=742, Total=3422 [2024-11-14 03:48:09,510 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 59 states, 58 states have (on average 2.4310344827586206) internal successors, (141), 59 states have internal predecessors, (141), 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 03:48:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:48:19,739 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-14 03:48:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:48:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.4310344827586206) internal successors, (141), 59 states have internal predecessors, (141), 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 03:48:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:48:19,740 INFO L225 Difference]: With dead ends: 85 [2024-11-14 03:48:19,740 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 03:48:19,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 190 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=479, Invalid=4363, Unknown=16, NotChecked=994, Total=5852 [2024-11-14 03:48:19,742 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:48:19,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 626 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1041 Invalid, 0 Unknown, 448 Unchecked, 4.6s Time] [2024-11-14 03:48:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 03:48:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-14 03:48:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 79 states have internal predecessors, (85), 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 03:48:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-14 03:48:19,745 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 43 [2024-11-14 03:48:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:48:19,745 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-14 03:48:19,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.4310344827586206) internal successors, (141), 59 states have internal predecessors, (141), 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 03:48:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-14 03:48:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 03:48:19,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:48:19,747 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:48:19,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 03:48:19,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:48:20,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 03:48:20,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:48:20,348 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:48:20,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:48:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1157113866, now seen corresponding path program 1 times [2024-11-14 03:48:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:48:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17175342] [2024-11-14 03:48:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:48:20,349 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 03:48:20,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:48:20,350 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:48:20,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4e6f4c5-b005-4db5-9de1-362c3dd01b05/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 03:48:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:48:20,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-14 03:48:20,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:48:20,935 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 03:48:21,085 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 03:48:21,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 03:48:21,240 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 03:48:21,240 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 03:48:21,476 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 03:48:21,477 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 03:48:21,657 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 11 treesize of output 7 [2024-11-14 03:48:21,768 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 03:48:22,015 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2024-11-14 03:48:22,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 31 [2024-11-14 03:48:22,135 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 11 treesize of output 7 [2024-11-14 03:48:22,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 03:48:22,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:48:22,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:48:22,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:48:22,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:48:22,368 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:48:22,368 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2024-11-14 03:48:22,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 03:48:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-14 03:48:22,629 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 03:48:22,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-14 03:48:22,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:48:22,677 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 47 treesize of output 27 [2024-11-14 03:48:22,685 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 20 treesize of output 15 [2024-11-14 03:48:22,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:48:23,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:48:23,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2024-11-14 03:48:23,142 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 20 treesize of output 15 [2024-11-14 03:48:23,175 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 47 treesize of output 23 [2024-11-14 03:48:23,184 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 03:48:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:48:23,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:48:23,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2360) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0))))) is different from false [2024-11-14 03:48:23,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv4 32)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2360) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))))) is different from false [2024-11-14 03:48:23,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2024-11-14 03:48:24,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_2352 .cse0))) v_ArrVal_2352)) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2350) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2024-11-14 03:48:24,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (_ BitVec 32)) (v_ArrVal_2350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2347 (_ BitVec 32)) (v_ArrVal_2354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2346)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2350) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2354) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2347)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (not (= (let ((.cse1 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2352 .cse1))) v_ArrVal_2352)))) is different from false [2024-11-14 03:48:24,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:24,091 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 2 case distinctions, treesize of input 66 treesize of output 72 [2024-11-14 03:48:24,102 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 222 treesize of output 210 [2024-11-14 03:48:24,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 104 treesize of output 100 [2024-11-14 03:48:24,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:24,169 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 2 case distinctions, treesize of input 202 treesize of output 168 [2024-11-14 03:48:24,179 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 150 treesize of output 142 [2024-11-14 03:48:24,188 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 488 treesize of output 458 [2024-11-14 03:48:24,200 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 106 treesize of output 98 [2024-11-14 03:48:24,214 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 50 treesize of output 46 [2024-11-14 03:48:24,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (not .cse3)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (or (not .cse0) (and (forall ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store v_ArrVal_2348 .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352)) (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_arrayElimCell_264) v_arrayElimCell_266))) (= (select (select .cse2 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store v_ArrVal_2348 .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352)))) .cse3))) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) v_arrayElimCell_264) v_arrayElimCell_266)) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352)))) .cse4) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 v_arrayElimCell_264) v_arrayElimCell_266)) (= (select (select .cse5 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352))))) .cse4) (or (and (or (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse0) (forall ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_263 (_ BitVec 32))) (= (select (select .cse6 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352))))) .cse3) (forall ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 v_arrayElimCell_264) v_arrayElimCell_266)) (= (select (select .cse7 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2352 .cse1)) v_ArrVal_2352))))))) is different from false [2024-11-14 03:48:25,524 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 1 [2024-11-14 03:48:25,549 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 1 [2024-11-14 03:48:25,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (not .cse1)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (or (not .cse0) (and (or .cse1 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_arrayElimCell_264) v_arrayElimCell_266)) (= (select (select .cse2 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) v_arrayElimCell_264) v_arrayElimCell_266)) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2352 .cse3)) v_ArrVal_2352)))) .cse4) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 v_arrayElimCell_264) v_arrayElimCell_266)) (= (select (select .cse5 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2352 .cse3)) v_ArrVal_2352))))) .cse4) (or (and (or (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2352 .cse3)) v_ArrVal_2352)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse0) (forall ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_263 (_ BitVec 32))) (= (select (select .cse6 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2352 .cse3)) v_ArrVal_2352))))) .cse1) (forall ((v_ArrVal_2352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2355 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_263 (_ BitVec 32)) (v_arrayElimCell_264 (_ BitVec 32))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2360))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 v_arrayElimCell_264) v_arrayElimCell_266)) (= (select (select .cse7 v_arrayElimCell_263) v_arrayElimCell_267) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2348) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2352 .cse3)) v_ArrVal_2352))))))) is different from false [2024-11-14 03:48:37,113 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-14 03:48:37,114 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 2 case distinctions, treesize of input 1036 treesize of output 1038 [2024-11-14 03:48:37,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:37,184 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 138 treesize of output 136 [2024-11-14 03:48:37,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:37,269 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 338 treesize of output 336 [2024-11-14 03:48:37,306 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 283 treesize of output 275 [2024-11-14 03:48:37,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:37,378 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 340 treesize of output 340 [2024-11-14 03:48:37,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:37,450 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 175 treesize of output 163 [2024-11-14 03:48:37,518 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 [2024-11-14 03:48:44,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:44,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 450 treesize of output 932 [2024-11-14 03:48:52,792 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-14 03:48:52,793 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 984 treesize of output 999 [2024-11-14 03:48:52,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:52,962 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 419 treesize of output 429 [2024-11-14 03:48:53,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:53,060 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 463 treesize of output 455 [2024-11-14 03:48:53,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:53,141 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 495 treesize of output 491 [2024-11-14 03:48:53,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:53,214 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 109 treesize of output 101 [2024-11-14 03:48:53,294 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 [2024-11-14 03:49:00,796 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 03:49:00,875 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 03:49:00,945 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 03:49:01,003 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 03:49:01,092 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 03:49:01,178 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 03:49:01,416 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 03:49:01,766 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 03:49:03,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:03,626 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 54 treesize of output 56 [2024-11-14 03:49:17,164 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 [2024-11-14 03:49:17,169 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:49:17,174 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:49:17,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:49:17,541 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-14 03:49:17,542 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 4867 treesize of output 4834 [2024-11-14 03:49:17,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:49:17,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:17,730 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 406 treesize of output 414 [2024-11-14 03:49:17,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:17,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 400 treesize of output 410 [2024-11-14 03:49:18,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:18,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 372 treesize of output 378 [2024-11-14 03:49:18,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:18,163 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 229 treesize of output 205 [2024-11-14 03:49:21,018 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