./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:31:58,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:31:58,218 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:31:58,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:31:58,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:31:58,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:31:58,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:31:58,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:31:58,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:31:58,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:31:58,251 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:31:58,251 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:31:58,251 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:31:58,252 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:31:58,252 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:31:58,253 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:31:58,253 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:31:58,253 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:31:58,254 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:31:58,254 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:31:58,255 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:31:58,255 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:31:58,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:31:58,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:31:58,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:31:58,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:31:58,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:31:58,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:31:58,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:31:58,259 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:31:58,259 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:31:58,260 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:31:58,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:31:58,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:31:58,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:31:58,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:31:58,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:31:58,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:31:58,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:31:58,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:31:58,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:31:58,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:31:58,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:31:58,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:31:58,264 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:31:58,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:31:58,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:31:58,265 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:31:58,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:31:58,266 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-09 04:31:58,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:31:58,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:31:58,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:31:58,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:31:58,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:31:58,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i Unable to find full path for "g++" [2024-11-09 04:32:00,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:32:00,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:32:00,841 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-09 04:32:00,855 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data/154cd5622/ddab093f736a4309ad0904cae69563be/FLAG95a2b0a7e [2024-11-09 04:32:00,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data/154cd5622/ddab093f736a4309ad0904cae69563be [2024-11-09 04:32:00,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:32:00,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:32:00,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:00,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:32:00,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:32:00,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187e5b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00, skipping insertion in model container [2024-11-09 04:32:00,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:32:01,338 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:32:01,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:01,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:32:01,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:01,479 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:32:01,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01 WrapperNode [2024-11-09 04:32:01,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:01,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:01,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:32:01,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:32:01,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,558 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-09 04:32:01,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:01,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:32:01,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:32:01,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:32:01,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:32:01,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:32:01,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:32:01,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:32:01,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (1/1) ... [2024-11-09 04:32:01,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:32:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:01,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:32:01,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:32:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:32:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:32:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:32:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:32:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:32:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:32:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:32:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:32:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:32:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:32:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:32:01,814 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:32:01,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:32:02,328 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 04:32:02,328 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:32:02,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:32:02,380 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 04:32:02,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:02 BoogieIcfgContainer [2024-11-09 04:32:02,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:32:02,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:32:02,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:32:02,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:32:02,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:32:00" (1/3) ... [2024-11-09 04:32:02,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd38334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:02, skipping insertion in model container [2024-11-09 04:32:02,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:01" (2/3) ... [2024-11-09 04:32:02,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd38334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:02, skipping insertion in model container [2024-11-09 04:32:02,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:02" (3/3) ... [2024-11-09 04:32:02,395 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-09 04:32:02,420 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:32:02,420 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-09 04:32:02,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:32:02,478 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;@78505516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:32:02,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 04:32:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 43 states have (on average 2.302325581395349) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 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-09 04:32:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 04:32:02,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:02,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 04:32:02,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:02,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash 181823, now seen corresponding path program 1 times [2024-11-09 04:32:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740216751] [2024-11-09 04:32:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:02,910 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-09 04:32:02,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740216751] [2024-11-09 04:32:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740216751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:02,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383596241] [2024-11-09 04:32:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:32:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:32:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:02,964 INFO L87 Difference]: Start difference. First operand has 90 states, 43 states have (on average 2.302325581395349) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:03,206 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-09 04:32:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:32:03,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 04:32:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:03,220 INFO L225 Difference]: With dead ends: 93 [2024-11-09 04:32:03,220 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 04:32:03,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:03,229 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 105 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:03,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 76 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:32:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 04:32:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2024-11-09 04:32:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 2.088888888888889) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 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-09 04:32:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-11-09 04:32:03,263 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 3 [2024-11-09 04:32:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:03,264 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-11-09 04:32:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-11-09 04:32:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 04:32:03,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:03,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 04:32:03,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:32:03,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:03,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash 181824, now seen corresponding path program 1 times [2024-11-09 04:32:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64934174] [2024-11-09 04:32:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:03,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:03,525 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-09 04:32:03,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64934174] [2024-11-09 04:32:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64934174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:03,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284750709] [2024-11-09 04:32:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:03,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:32:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:32:03,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:03,532 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:03,784 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2024-11-09 04:32:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:32:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 04:32:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:03,786 INFO L225 Difference]: With dead ends: 129 [2024-11-09 04:32:03,788 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 04:32:03,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:03,790 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 87 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:03,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 89 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:32:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 04:32:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2024-11-09 04:32:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 96 states have internal predecessors, (113), 0 states have call successors, (0), 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-09 04:32:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2024-11-09 04:32:03,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 3 [2024-11-09 04:32:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2024-11-09 04:32:03,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2024-11-09 04:32:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:32:03,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:03,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:32:03,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:32:03,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 5636493, now seen corresponding path program 1 times [2024-11-09 04:32:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883777869] [2024-11-09 04:32:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:03,893 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-09 04:32:03,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883777869] [2024-11-09 04:32:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883777869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:03,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836486169] [2024-11-09 04:32:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:03,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:03,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:03,899 INFO L87 Difference]: Start difference. First operand 97 states and 113 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-09 04:32:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:04,000 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-11-09 04:32:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:04,001 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-09 04:32:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:04,002 INFO L225 Difference]: With dead ends: 95 [2024-11-09 04:32:04,002 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 04:32:04,003 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-09 04:32:04,004 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:04,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 04:32:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 04:32:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 94 states have internal predecessors, (110), 0 states have call successors, (0), 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-09 04:32:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-09 04:32:04,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 4 [2024-11-09 04:32:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:04,018 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-09 04:32:04,018 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-09 04:32:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-09 04:32:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:32:04,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:04,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:32:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:32:04,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 5636494, now seen corresponding path program 1 times [2024-11-09 04:32:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288425719] [2024-11-09 04:32:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:04,145 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-09 04:32:04,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288425719] [2024-11-09 04:32:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288425719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:04,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237856903] [2024-11-09 04:32:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:04,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:04,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:04,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:04,148 INFO L87 Difference]: Start difference. First operand 95 states and 110 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-09 04:32:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:04,244 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-11-09 04:32:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:04,245 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-09 04:32:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:04,246 INFO L225 Difference]: With dead ends: 93 [2024-11-09 04:32:04,249 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 04:32:04,249 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-09 04:32:04,250 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 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-09 04:32:04,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 04:32:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 04:32:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 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-09 04:32:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-09 04:32:04,264 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 4 [2024-11-09 04:32:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:04,264 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-09 04:32:04,264 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-09 04:32:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-09 04:32:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 04:32:04,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:04,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:32:04,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash 417466323, now seen corresponding path program 1 times [2024-11-09 04:32:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060662814] [2024-11-09 04:32:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:04,351 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-09 04:32:04,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:04,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060662814] [2024-11-09 04:32:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060662814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121705775] [2024-11-09 04:32:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:04,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:04,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:04,356 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:04,445 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-09 04:32:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 04:32:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:04,447 INFO L225 Difference]: With dead ends: 89 [2024-11-09 04:32:04,447 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 04:32:04,449 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-09 04:32:04,450 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:04,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 04:32:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 04:32:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 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-09 04:32:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-09 04:32:04,462 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 7 [2024-11-09 04:32:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:04,463 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-09 04:32:04,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-09 04:32:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 04:32:04,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:04,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:04,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:32:04,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:04,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash 417466324, now seen corresponding path program 1 times [2024-11-09 04:32:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:04,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675632921] [2024-11-09 04:32:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:04,591 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-09 04:32:04,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675632921] [2024-11-09 04:32:04,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675632921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:04,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954018628] [2024-11-09 04:32:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:04,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:04,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:04,597 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:04,677 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-09 04:32:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:04,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 04:32:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:04,680 INFO L225 Difference]: With dead ends: 85 [2024-11-09 04:32:04,680 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 04:32:04,680 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-09 04:32:04,681 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:04,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 04:32:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 04:32:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.736842105263158) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 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-09 04:32:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 04:32:04,694 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 7 [2024-11-09 04:32:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:04,695 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 04:32:04,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 04:32:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:32:04,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:04,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:04,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:32:04,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:04,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash 509030128, now seen corresponding path program 1 times [2024-11-09 04:32:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:04,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316214735] [2024-11-09 04:32:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:04,872 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-09 04:32:04,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316214735] [2024-11-09 04:32:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316214735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:04,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:04,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:04,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386494228] [2024-11-09 04:32:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:04,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:04,876 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:05,012 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2024-11-09 04:32:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:32:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 04:32:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:05,013 INFO L225 Difference]: With dead ends: 93 [2024-11-09 04:32:05,014 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 04:32:05,014 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-09 04:32:05,015 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:05,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 04:32:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-09 04:32:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 04:32:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2024-11-09 04:32:05,027 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 11 [2024-11-09 04:32:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:05,028 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2024-11-09 04:32:05,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2024-11-09 04:32:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:32:05,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:05,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:05,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 04:32:05,029 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:05,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 509030129, now seen corresponding path program 1 times [2024-11-09 04:32:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:05,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492676795] [2024-11-09 04:32:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:05,314 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-09 04:32:05,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:05,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492676795] [2024-11-09 04:32:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492676795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148605831] [2024-11-09 04:32:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:05,317 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:05,499 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-09 04:32:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:32:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 04:32:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:05,500 INFO L225 Difference]: With dead ends: 89 [2024-11-09 04:32:05,501 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 04:32:05,501 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-09 04:32:05,502 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:05,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 04:32:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 04:32:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 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-09 04:32:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-09 04:32:05,506 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 11 [2024-11-09 04:32:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:05,507 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-09 04:32:05,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-09 04:32:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:32:05,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:05,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:05,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:32:05,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:05,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2144960094, now seen corresponding path program 1 times [2024-11-09 04:32:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:05,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256521180] [2024-11-09 04:32:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:05,723 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-09 04:32:05,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:05,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256521180] [2024-11-09 04:32:05,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256521180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:05,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:05,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:05,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539528947] [2024-11-09 04:32:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:05,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:05,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:05,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:05,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:05,725 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:05,841 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-09 04:32:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:32:05,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 04:32:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:05,843 INFO L225 Difference]: With dead ends: 88 [2024-11-09 04:32:05,843 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 04:32:05,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:32:05,844 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 109 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:05,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 04:32:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-09 04:32:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.706896551724138) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 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-09 04:32:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-09 04:32:05,848 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 12 [2024-11-09 04:32:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-09 04:32:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-09 04:32:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:32:05,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:05,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:05,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:32:05,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:05,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366465, now seen corresponding path program 1 times [2024-11-09 04:32:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541157570] [2024-11-09 04:32:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:06,018 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-09 04:32:06,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541157570] [2024-11-09 04:32:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541157570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:06,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651601971] [2024-11-09 04:32:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:06,021 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:06,149 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-09 04:32:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:06,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:06,151 INFO L225 Difference]: With dead ends: 120 [2024-11-09 04:32:06,151 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 04:32:06,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:06,152 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 59 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:06,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 04:32:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2024-11-09 04:32:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 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-09 04:32:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-11-09 04:32:06,156 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 13 [2024-11-09 04:32:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:06,156 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-11-09 04:32:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-11-09 04:32:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:32:06,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:06,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:06,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:32:06,157 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366437, now seen corresponding path program 1 times [2024-11-09 04:32:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629637772] [2024-11-09 04:32:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:06,304 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-09 04:32:06,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629637772] [2024-11-09 04:32:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629637772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341451847] [2024-11-09 04:32:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:06,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:06,306 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:06,488 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-09 04:32:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:06,490 INFO L225 Difference]: With dead ends: 116 [2024-11-09 04:32:06,490 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 04:32:06,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:32:06,491 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:06,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:32:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 04:32:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2024-11-09 04:32:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 04:32:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-09 04:32:06,494 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 13 [2024-11-09 04:32:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:06,495 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-09 04:32:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-09 04:32:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:32:06,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:06,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:32:06,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1822366438, now seen corresponding path program 1 times [2024-11-09 04:32:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539545600] [2024-11-09 04:32:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:06,733 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-09 04:32:06,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539545600] [2024-11-09 04:32:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539545600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751275014] [2024-11-09 04:32:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:06,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:06,736 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:06,947 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2024-11-09 04:32:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:06,949 INFO L225 Difference]: With dead ends: 133 [2024-11-09 04:32:06,949 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 04:32:06,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:06,950 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:06,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 173 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:32:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 04:32:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2024-11-09 04:32:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 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-09 04:32:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-09 04:32:06,954 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 13 [2024-11-09 04:32:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:06,955 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-09 04:32:06,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-09 04:32:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-09 04:32:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:32:06,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:06,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:06,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:32:06,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:06,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1052437646, now seen corresponding path program 1 times [2024-11-09 04:32:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78162898] [2024-11-09 04:32:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:07,024 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-09 04:32:07,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78162898] [2024-11-09 04:32:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78162898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383230663] [2024-11-09 04:32:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:07,027 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:32:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:07,181 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-09 04:32:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:32:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:32:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:07,182 INFO L225 Difference]: With dead ends: 106 [2024-11-09 04:32:07,182 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 04:32:07,183 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-09 04:32:07,183 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:07,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 145 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 04:32:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-09 04:32:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 93 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 04:32:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-09 04:32:07,188 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 15 [2024-11-09 04:32:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:07,188 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-09 04:32:07,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:32:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-09 04:32:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:32:07,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:07,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:07,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 04:32:07,194 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:07,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1052437645, now seen corresponding path program 1 times [2024-11-09 04:32:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:07,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448961272] [2024-11-09 04:32:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:07,529 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-09 04:32:07,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:07,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448961272] [2024-11-09 04:32:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448961272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:07,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943156115] [2024-11-09 04:32:07,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:07,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:07,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:07,531 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:32:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:07,741 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-09 04:32:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:32:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:07,742 INFO L225 Difference]: With dead ends: 130 [2024-11-09 04:32:07,742 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 04:32:07,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:32:07,743 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:07,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 198 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:32:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 04:32:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2024-11-09 04:32:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.542857142857143) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 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-09 04:32:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-11-09 04:32:07,747 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 15 [2024-11-09 04:32:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:07,747 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-11-09 04:32:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:32:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-11-09 04:32:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:32:07,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:07,748 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:07,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 04:32:07,748 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:07,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1228622250, now seen corresponding path program 1 times [2024-11-09 04:32:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:07,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596504117] [2024-11-09 04:32:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:07,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:07,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596504117] [2024-11-09 04:32:07,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596504117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:07,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660812901] [2024-11-09 04:32:07,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:07,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:07,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:07,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:08,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:32:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:08,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 04:32:08,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:32:08,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:32:08,199 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-09 04:32:08,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:32:08,314 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:32:08,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 04:32:08,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:32:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:08,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:08,392 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 04:32:08,393 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 21 treesize of output 20 [2024-11-09 04:32:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660812901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2144146775] [2024-11-09 04:32:08,523 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 04:32:08,524 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:32:08,528 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:32:08,534 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:32:08,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:32:10,502 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:32:12,757 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3005#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (= (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 |ULTIMATE.start_create_data_~counter~0#1|) (<= |ULTIMATE.start_create_data_~counter~0#1| 19) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) 1)) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (= |ULTIMATE.start_create_data_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-09 04:32:12,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:32:12,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:32:12,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 04:32:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668317064] [2024-11-09 04:32:12,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:32:12,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:32:12,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:12,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:32:12,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=475, Unknown=3, NotChecked=0, Total=552 [2024-11-09 04:32:12,760 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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-09 04:32:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:13,190 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-11-09 04:32:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:13,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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-09 04:32:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:13,192 INFO L225 Difference]: With dead ends: 95 [2024-11-09 04:32:13,193 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 04:32:13,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=100, Invalid=599, Unknown=3, NotChecked=0, Total=702 [2024-11-09 04:32:13,196 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 23 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:13,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 454 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:32:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 04:32:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 04:32:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 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-09 04:32:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-09 04:32:13,202 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 15 [2024-11-09 04:32:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-09 04:32:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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-09 04:32:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-09 04:32:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:32:13,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:13,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:13,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:32:13,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 04:32:13,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:13,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1228622249, now seen corresponding path program 1 times [2024-11-09 04:32:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:13,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255217726] [2024-11-09 04:32:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:13,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255217726] [2024-11-09 04:32:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255217726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068519197] [2024-11-09 04:32:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:13,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:13,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:13,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:13,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:32:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:14,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 04:32:14,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:14,021 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-09 04:32:14,039 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:32:14,039 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-09 04:32:14,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:32:14,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:32:14,071 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-09 04:32:14,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:32:14,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:32:14,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:32:14,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:32:14,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 9 treesize of output 3 [2024-11-09 04:32:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:14,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:14,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_336 (Array Int Int)) (v_ArrVal_335 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_336) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_335) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_336 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_336) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2024-11-09 04:32:14,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:14,543 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 24 treesize of output 25 [2024-11-09 04:32:14,548 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 40 treesize of output 28 [2024-11-09 04:32:14,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:14,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 04:32:14,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:14,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:32:14,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:32:14,585 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 33 treesize of output 21 [2024-11-09 04:32:14,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:32:14,593 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 24 treesize of output 12 [2024-11-09 04:32:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 04:32:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068519197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1124182400] [2024-11-09 04:32:14,664 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 04:32:14,664 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:32:14,665 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:32:14,665 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:32:14,665 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:32:15,992 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:32:18,156 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3313#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (exists ((|v_ULTIMATE.start_create_data_~counter~0#1_34| Int)) (and (or (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_34| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_34| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4) 4))) (<= 1 |#StackHeapBarrier|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_34|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= |v_ULTIMATE.start_create_data_~counter~0#1_34| 19))) (= (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|) 1) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-09 04:32:18,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:32:18,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:32:18,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-09 04:32:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129954947] [2024-11-09 04:32:18,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:32:18,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 04:32:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 04:32:18,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=616, Unknown=3, NotChecked=50, Total=756 [2024-11-09 04:32:18,159 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 04:32:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:18,969 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2024-11-09 04:32:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:32:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 04:32:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:18,971 INFO L225 Difference]: With dead ends: 103 [2024-11-09 04:32:18,972 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 04:32:18,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=150, Invalid=973, Unknown=3, NotChecked=64, Total=1190 [2024-11-09 04:32:18,973 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:18,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 422 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 12 Unknown, 52 Unchecked, 0.5s Time] [2024-11-09 04:32:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 04:32:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 04:32:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.5) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 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-09 04:32:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2024-11-09 04:32:18,978 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 15 [2024-11-09 04:32:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:18,979 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2024-11-09 04:32:18,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 04:32:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2024-11-09 04:32:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 04:32:18,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:18,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:19,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:32:19,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:19,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:19,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2075207029, now seen corresponding path program 1 times [2024-11-09 04:32:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715576980] [2024-11-09 04:32:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:19,724 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-09 04:32:19,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:19,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715576980] [2024-11-09 04:32:19,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715576980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:19,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:19,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:32:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114923482] [2024-11-09 04:32:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:19,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 04:32:19,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 04:32:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:32:19,726 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 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-09 04:32:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:20,171 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2024-11-09 04:32:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:32:20,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 04:32:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:20,172 INFO L225 Difference]: With dead ends: 132 [2024-11-09 04:32:20,172 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 04:32:20,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-09 04:32:20,173 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 108 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:20,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 197 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:32:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 04:32:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2024-11-09 04:32:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.449438202247191) internal successors, (129), 113 states have internal predecessors, (129), 0 states have call successors, (0), 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-09 04:32:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-09 04:32:20,177 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 17 [2024-11-09 04:32:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:20,177 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-09 04:32:20,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 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-09 04:32:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-09 04:32:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 04:32:20,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:20,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:20,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 04:32:20,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:20,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1409161816, now seen corresponding path program 1 times [2024-11-09 04:32:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:20,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399056750] [2024-11-09 04:32:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:20,303 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-09 04:32:20,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399056750] [2024-11-09 04:32:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399056750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691026246] [2024-11-09 04:32:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:20,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:20,306 INFO L87 Difference]: Start difference. First operand 114 states and 129 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-09 04:32:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:20,430 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2024-11-09 04:32:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:20,431 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 19 [2024-11-09 04:32:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:20,432 INFO L225 Difference]: With dead ends: 143 [2024-11-09 04:32:20,432 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 04:32:20,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:20,433 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:20,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 04:32:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2024-11-09 04:32:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.5247524752475248) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 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-09 04:32:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2024-11-09 04:32:20,439 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 19 [2024-11-09 04:32:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:20,440 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2024-11-09 04:32:20,440 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-09 04:32:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2024-11-09 04:32:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:32:20,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:20,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:20,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 04:32:20,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:20,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -734343168, now seen corresponding path program 1 times [2024-11-09 04:32:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287280946] [2024-11-09 04:32:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:20,585 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-09 04:32:20,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287280946] [2024-11-09 04:32:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287280946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:20,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347339856] [2024-11-09 04:32:20,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:20,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:20,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:20,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:20,589 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 04:32:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:20,760 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-11-09 04:32:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 04:32:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:20,762 INFO L225 Difference]: With dead ends: 142 [2024-11-09 04:32:20,762 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 04:32:20,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:20,763 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:20,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 153 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 04:32:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2024-11-09 04:32:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 126 states have internal predecessors, (155), 0 states have call successors, (0), 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-09 04:32:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2024-11-09 04:32:20,768 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 20 [2024-11-09 04:32:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:20,768 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2024-11-09 04:32:20,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 04:32:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2024-11-09 04:32:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:32:20,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:20,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:20,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 04:32:20,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:20,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1289801558, now seen corresponding path program 1 times [2024-11-09 04:32:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:20,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609582777] [2024-11-09 04:32:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:20,845 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-09 04:32:20,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609582777] [2024-11-09 04:32:20,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609582777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:20,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:20,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:32:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552239228] [2024-11-09 04:32:20,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:20,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:20,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:20,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:20,848 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:21,013 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2024-11-09 04:32:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:32:21,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 04:32:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:21,015 INFO L225 Difference]: With dead ends: 143 [2024-11-09 04:32:21,015 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 04:32:21,015 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-09 04:32:21,016 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:21,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 143 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 04:32:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2024-11-09 04:32:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.514018691588785) internal successors, (162), 131 states have internal predecessors, (162), 0 states have call successors, (0), 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-09 04:32:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2024-11-09 04:32:21,021 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 21 [2024-11-09 04:32:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:21,025 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2024-11-09 04:32:21,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2024-11-09 04:32:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:32:21,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:21,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:21,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 04:32:21,026 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1420165851, now seen corresponding path program 1 times [2024-11-09 04:32:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834586696] [2024-11-09 04:32:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:21,483 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-09 04:32:21,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:21,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834586696] [2024-11-09 04:32:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834586696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:21,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:21,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:32:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139373416] [2024-11-09 04:32:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:21,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:32:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:21,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:32:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:32:21,488 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:22,010 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2024-11-09 04:32:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 04:32:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 04:32:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:22,012 INFO L225 Difference]: With dead ends: 156 [2024-11-09 04:32:22,012 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 04:32:22,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:32:22,013 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 145 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:22,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 238 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:32:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 04:32:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2024-11-09 04:32:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 136 states have internal predecessors, (169), 0 states have call successors, (0), 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-09 04:32:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2024-11-09 04:32:22,017 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 21 [2024-11-09 04:32:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:22,018 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2024-11-09 04:32:22,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2024-11-09 04:32:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:32:22,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:22,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 04:32:22,019 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1420165852, now seen corresponding path program 1 times [2024-11-09 04:32:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100147018] [2024-11-09 04:32:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:22,630 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-09 04:32:22,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100147018] [2024-11-09 04:32:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100147018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:32:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878712710] [2024-11-09 04:32:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:22,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:32:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:32:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:32:22,632 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:23,389 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2024-11-09 04:32:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:32:23,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 04:32:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:23,391 INFO L225 Difference]: With dead ends: 158 [2024-11-09 04:32:23,391 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 04:32:23,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:32:23,392 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 127 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:23,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:32:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 04:32:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2024-11-09 04:32:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 136 states have internal predecessors, (165), 0 states have call successors, (0), 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-09 04:32:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2024-11-09 04:32:23,396 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 21 [2024-11-09 04:32:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:23,396 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-09 04:32:23,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:32:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2024-11-09 04:32:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:32:23,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:23,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:23,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 04:32:23,398 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1329142461, now seen corresponding path program 1 times [2024-11-09 04:32:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585709371] [2024-11-09 04:32:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:23,599 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-09 04:32:23,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585709371] [2024-11-09 04:32:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585709371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844112889] [2024-11-09 04:32:23,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:23,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:32:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:23,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:32:23,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:23,601 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-09 04:32:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:23,772 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2024-11-09 04:32:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:32:23,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 22 [2024-11-09 04:32:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:23,774 INFO L225 Difference]: With dead ends: 147 [2024-11-09 04:32:23,774 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 04:32:23,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:23,774 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 86 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:23,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 144 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 04:32:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2024-11-09 04:32:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 138 states have internal predecessors, (168), 0 states have call successors, (0), 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-09 04:32:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2024-11-09 04:32:23,778 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 22 [2024-11-09 04:32:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:23,778 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2024-11-09 04:32:23,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-09 04:32:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2024-11-09 04:32:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:32:23,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:23,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:23,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 04:32:23,780 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1329142460, now seen corresponding path program 1 times [2024-11-09 04:32:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748169342] [2024-11-09 04:32:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:23,840 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-09 04:32:23,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748169342] [2024-11-09 04:32:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748169342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:23,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:32:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752907865] [2024-11-09 04:32:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:23,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:32:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:32:23,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:23,841 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-09 04:32:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:23,902 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2024-11-09 04:32:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:32:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 22 [2024-11-09 04:32:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:23,903 INFO L225 Difference]: With dead ends: 134 [2024-11-09 04:32:23,903 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 04:32:23,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:32:23,904 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:23,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 41 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:32:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 04:32:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 04:32:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.391304347826087) internal successors, (160), 133 states have internal predecessors, (160), 0 states have call successors, (0), 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-09 04:32:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2024-11-09 04:32:23,908 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 22 [2024-11-09 04:32:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:23,908 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2024-11-09 04:32:23,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-09 04:32:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2024-11-09 04:32:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 04:32:23,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:23,908 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:23,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 04:32:23,909 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:23,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -907092957, now seen corresponding path program 2 times [2024-11-09 04:32:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404784046] [2024-11-09 04:32:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:24,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:24,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404784046] [2024-11-09 04:32:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404784046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:24,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481644479] [2024-11-09 04:32:24,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:32:24,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:24,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:24,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:24,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:32:24,768 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 04:32:24,768 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:32:24,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 04:32:24,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:24,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 5 [2024-11-09 04:32:24,788 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-09 04:32:24,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:32:24,798 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-09 04:32:24,841 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-09 04:32:24,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:32:24,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:32:24,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:32:24,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:32:25,107 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:32:25,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:32:25,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 30 treesize of output 13 [2024-11-09 04:32:25,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:32:25,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:32:25,277 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 43 treesize of output 24 [2024-11-09 04:32:25,387 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 32 treesize of output 14 [2024-11-09 04:32:25,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:32:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:25,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:26,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_create_data_~counter~0#1_40| Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_626)) (.cse3 (* |v_ULTIMATE.start_create_data_~counter~0#1_40| 4))) (or (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_627) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 4))) (< (+ (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3) 0)))) (< (+ |c_ULTIMATE.start_create_data_~counter~0#1| 1) |v_ULTIMATE.start_create_data_~counter~0#1_40|))) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_626)) (.cse6 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_627))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse6 11) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))) (< (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse6 4) 0))))))) is different from false [2024-11-09 04:32:26,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_40| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_624))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (* |v_ULTIMATE.start_create_data_~counter~0#1_40| 4)) (.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_625) .cse2 v_ArrVal_626))) (or (< 0 (+ 5 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_627) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4)) (< (+ .cse4 (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) 0) (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_40|)))))) (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_624))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_625) .cse10 v_ArrVal_626))) (or (let ((.cse8 (store .cse9 .cse10 v_ArrVal_627))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (< (+ .cse5 (select (select (store .cse6 .cse7 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 15) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))) (< (+ .cse5 8 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) 0)))))))) is different from false [2024-11-09 04:32:26,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_624))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_625) .cse6 v_ArrVal_626)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_627))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse3 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 15) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_create_data_~counter~0#1_40| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_624))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_625) .cse10 v_ArrVal_626)) (.cse11 (* |v_ULTIMATE.start_create_data_~counter~0#1_40| 4))) (or (< 0 (+ (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_627) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 5 .cse11)) (< (+ (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse11) 0) (< (+ 2 |c_ULTIMATE.start_create_data_~counter~0#1|) |v_ULTIMATE.start_create_data_~counter~0#1_40|))))))))) is different from false [2024-11-09 04:32:26,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:26,559 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 378 treesize of output 349 [2024-11-09 04:32:26,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:26,575 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 338 treesize of output 229 [2024-11-09 04:32:26,599 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 5343 treesize of output 4533 [2024-11-09 04:32:26,699 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 3848 treesize of output 3710 [2024-11-09 04:32:26,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 415 treesize of output 411 [2024-11-09 04:32:26,762 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 411 treesize of output 407 [2024-11-09 04:32:26,784 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 407 treesize of output 395 [2024-11-09 04:32:26,797 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 395 treesize of output 387 [2024-11-09 04:32:26,809 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 387 treesize of output 367 [2024-11-09 04:32:26,821 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 367 treesize of output 359 [2024-11-09 04:32:26,833 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 359 treesize of output 347 [2024-11-09 04:32:26,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 347 treesize of output 331 [2024-11-09 04:32:26,857 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 331 treesize of output 319 [2024-11-09 04:32:26,868 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 319 treesize of output 291 [2024-11-09 04:32:26,879 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 291 treesize of output 283 [2024-11-09 04:32:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-09 04:32:27,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481644479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129684571] [2024-11-09 04:32:27,181 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 04:32:27,182 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:32:27,183 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:32:27,183 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:32:27,183 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:32:28,882 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:32:31,356 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6045#(and (<= (+ |ULTIMATE.start_create_data_~data~0#1.offset| 8) (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|) 1) (exists ((|v_ULTIMATE.start_create_data_~counter~0#1_46| Int)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) 4)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4) (* |v_ULTIMATE.start_create_data_~counter~0#1_46| 4) 4)) (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) 4) (* |v_ULTIMATE.start_create_data_~counter~0#1_46| 4)) 0)) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= |v_ULTIMATE.start_create_data_~counter~0#1_46| 19) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_46|) (= |ULTIMATE.start_append_~node~0#1.offset| 0))) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-09 04:32:31,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:32:31,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:32:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-11-09 04:32:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381508085] [2024-11-09 04:32:31,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:32:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 04:32:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:31,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 04:32:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=12, NotChecked=228, Total=1722 [2024-11-09 04:32:31,359 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 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-09 04:32:32,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (.cse0 (+ .cse2 .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= 0 .cse0) (or (< .cse1 0) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ .cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (<= (+ .cse2 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (or (< .cse0 0) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse2 4))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_628) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_629) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (<= (+ .cse2 .cse5 4) (select |c_#length| .cse4)))))) is different from false [2024-11-09 04:32:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:33,112 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2024-11-09 04:32:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 04:32:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 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) Word has length 23 [2024-11-09 04:32:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:33,113 INFO L225 Difference]: With dead ends: 149 [2024-11-09 04:32:33,113 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 04:32:33,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=299, Invalid=2143, Unknown=24, NotChecked=396, Total=2862 [2024-11-09 04:32:33,115 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 7 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:33,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 574 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 552 Invalid, 27 Unknown, 214 Unchecked, 0.9s Time] [2024-11-09 04:32:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 04:32:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-09 04:32:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 145 states have internal predecessors, (174), 0 states have call successors, (0), 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-09 04:32:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2024-11-09 04:32:33,119 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 23 [2024-11-09 04:32:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:33,119 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2024-11-09 04:32:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 31 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-09 04:32:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2024-11-09 04:32:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 04:32:33,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:33,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:33,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 04:32:33,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:33,325 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1561874303, now seen corresponding path program 1 times [2024-11-09 04:32:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777009998] [2024-11-09 04:32:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:33,892 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-09 04:32:33,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777009998] [2024-11-09 04:32:33,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777009998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:33,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:33,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:32:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984948892] [2024-11-09 04:32:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:33,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:32:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:32:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:32:33,895 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-09 04:32:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:34,552 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2024-11-09 04:32:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:32:34,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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 24 [2024-11-09 04:32:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:34,553 INFO L225 Difference]: With dead ends: 166 [2024-11-09 04:32:34,553 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 04:32:34,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-09 04:32:34,554 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 126 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:34,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 292 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:32:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 04:32:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2024-11-09 04:32:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 145 states have internal predecessors, (172), 0 states have call successors, (0), 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-09 04:32:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2024-11-09 04:32:34,559 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 24 [2024-11-09 04:32:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2024-11-09 04:32:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-09 04:32:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2024-11-09 04:32:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 04:32:34,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:34,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:34,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 04:32:34,561 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1561885288, now seen corresponding path program 1 times [2024-11-09 04:32:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942546244] [2024-11-09 04:32:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,694 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-09 04:32:35,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:35,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942546244] [2024-11-09 04:32:35,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942546244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:35,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:35,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 04:32:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493428171] [2024-11-09 04:32:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:35,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:32:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:32:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:32:35,696 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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-09 04:32:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:36,514 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2024-11-09 04:32:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:32:36,516 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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 24 [2024-11-09 04:32:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:36,517 INFO L225 Difference]: With dead ends: 217 [2024-11-09 04:32:36,517 INFO L226 Difference]: Without dead ends: 217 [2024-11-09 04:32:36,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-11-09 04:32:36,519 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 98 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:36,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 382 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:32:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-09 04:32:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 173. [2024-11-09 04:32:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 172 states have internal predecessors, (205), 0 states have call successors, (0), 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-09 04:32:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2024-11-09 04:32:36,523 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 24 [2024-11-09 04:32:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:36,523 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2024-11-09 04:32:36,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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-09 04:32:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2024-11-09 04:32:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 04:32:36,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:36,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:36,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 04:32:36,525 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1173803524, now seen corresponding path program 1 times [2024-11-09 04:32:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300943413] [2024-11-09 04:32:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:37,768 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-09 04:32:37,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300943413] [2024-11-09 04:32:37,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300943413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:37,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:37,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 04:32:37,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888125810] [2024-11-09 04:32:37,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:37,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:32:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:32:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:32:37,771 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-09 04:32:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:38,716 INFO L93 Difference]: Finished difference Result 203 states and 235 transitions. [2024-11-09 04:32:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 04:32:38,717 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 04:32:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:38,718 INFO L225 Difference]: With dead ends: 203 [2024-11-09 04:32:38,718 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 04:32:38,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2024-11-09 04:32:38,719 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:38,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 402 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:32:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 04:32:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 176. [2024-11-09 04:32:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3312101910828025) internal successors, (209), 175 states have internal predecessors, (209), 0 states have call successors, (0), 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-09 04:32:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2024-11-09 04:32:38,727 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 209 transitions. Word has length 25 [2024-11-09 04:32:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:38,727 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 209 transitions. [2024-11-09 04:32:38,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 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-09 04:32:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 209 transitions. [2024-11-09 04:32:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 04:32:38,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:38,728 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:38,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 04:32:38,729 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:32:38,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:38,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2102981751, now seen corresponding path program 1 times [2024-11-09 04:32:38,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:38,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152830909] [2024-11-09 04:32:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:38,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:39,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152830909] [2024-11-09 04:32:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152830909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340894301] [2024-11-09 04:32:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:39,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:39,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:32:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:39,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 04:32:39,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:39,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:32:39,413 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-09 04:32:39,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:32:39,470 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-09 04:32:39,508 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:32:39,508 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 23 treesize of output 15 [2024-11-09 04:32:39,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:40,000 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 97 treesize of output 69 [2024-11-09 04:32:40,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 04:32:40,286 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem22#1.base_13| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_28| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_13| 0) |v_ULTIMATE.start_main_~#list~0#1.base_28| 0)) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_13| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_28| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_13|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_28|) 0))) is different from true [2024-11-09 04:32:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:40,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:40,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 04:32:40,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| v_ArrVal_801))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= .cse0 0) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-09 04:32:40,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_append_~node~0#1.base_20| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_799 Int)) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_801) |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_20|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20|) 0)) (= .cse0 0) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_799) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-09 04:32:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:32:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340894301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703205997] [2024-11-09 04:32:40,696 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 04:32:40,696 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:32:40,696 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:32:40,697 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:32:40,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:32:41,774 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:33:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1703205997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:21,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:33:21,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 9, 10] total 43 [2024-11-09 04:33:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085510040] [2024-11-09 04:33:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:21,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 04:33:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 04:33:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1467, Unknown=11, NotChecked=246, Total=1980 [2024-11-09 04:33:21,295 INFO L87 Difference]: Start difference. First operand 176 states and 209 transitions. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-09 04:33:25,000 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-09 04:33:27,425 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-09 04:33:29,537 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-09 04:33:34,478 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-09 04:33:36,631 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-09 04:33:42,394 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-09 04:33:44,973 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-09 04:33:47,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:33:49,331 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-09 04:33:54,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-09 04:34:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:02,270 INFO L93 Difference]: Finished difference Result 202 states and 236 transitions. [2024-11-09 04:34:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 04:34:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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 26 [2024-11-09 04:34:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:02,271 INFO L225 Difference]: With dead ends: 202 [2024-11-09 04:34:02,271 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 04:34:02,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=307, Invalid=1759, Unknown=16, NotChecked=270, Total=2352 [2024-11-09 04:34:02,273 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:02,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 202 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 582 Invalid, 12 Unknown, 0 Unchecked, 24.6s Time] [2024-11-09 04:34:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 04:34:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-11-09 04:34:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 1.3212121212121213) internal successors, (218), 183 states have internal predecessors, (218), 0 states have call successors, (0), 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-09 04:34:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2024-11-09 04:34:02,277 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 26 [2024-11-09 04:34:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:02,277 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2024-11-09 04:34:02,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-09 04:34:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2024-11-09 04:34:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 04:34:02,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:02,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:02,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 04:34:02,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 04:34:02,484 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:34:02,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1878482145, now seen corresponding path program 1 times [2024-11-09 04:34:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:02,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142797697] [2024-11-09 04:34:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:02,672 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-09 04:34:02,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142797697] [2024-11-09 04:34:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142797697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:34:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:34:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085604857] [2024-11-09 04:34:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:34:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:34:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:34:02,678 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-09 04:34:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:02,861 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2024-11-09 04:34:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:34:02,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 04:34:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:02,862 INFO L225 Difference]: With dead ends: 190 [2024-11-09 04:34:02,862 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 04:34:02,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:34:02,863 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:02,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 85 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:34:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 04:34:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-09 04:34:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 187 states have internal predecessors, (222), 0 states have call successors, (0), 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-09 04:34:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2024-11-09 04:34:02,870 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 27 [2024-11-09 04:34:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:02,871 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2024-11-09 04:34:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-09 04:34:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2024-11-09 04:34:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:34:02,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:02,872 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:02,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 04:34:02,872 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:34:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -276683225, now seen corresponding path program 1 times [2024-11-09 04:34:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:02,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039782917] [2024-11-09 04:34:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:34:03,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039782917] [2024-11-09 04:34:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039782917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:34:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 04:34:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733746737] [2024-11-09 04:34:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:03,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:34:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:34:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:34:03,510 INFO L87 Difference]: Start difference. First operand 188 states and 222 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 04:34:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:03,992 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2024-11-09 04:34:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:34:03,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 04:34:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:03,993 INFO L225 Difference]: With dead ends: 209 [2024-11-09 04:34:03,994 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 04:34:03,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-09 04:34:03,994 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:03,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 472 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:34:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 04:34:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 188. [2024-11-09 04:34:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 187 states have internal predecessors, (219), 0 states have call successors, (0), 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-09 04:34:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2024-11-09 04:34:03,998 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 30 [2024-11-09 04:34:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:03,999 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2024-11-09 04:34:03,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 04:34:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2024-11-09 04:34:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:34:04,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:04,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:04,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 04:34:04,000 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:34:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1562179863, now seen corresponding path program 1 times [2024-11-09 04:34:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993788987] [2024-11-09 04:34:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:04,675 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-09 04:34:04,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993788987] [2024-11-09 04:34:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993788987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:34:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 04:34:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289722247] [2024-11-09 04:34:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:04,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:34:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:34:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:34:04,677 INFO L87 Difference]: Start difference. First operand 188 states and 219 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 04:34:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:05,277 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2024-11-09 04:34:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 04:34:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 04:34:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:05,279 INFO L225 Difference]: With dead ends: 202 [2024-11-09 04:34:05,279 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 04:34:05,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:34:05,280 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:05,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 445 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:34:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 04:34:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 190. [2024-11-09 04:34:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.2923976608187135) internal successors, (221), 189 states have internal predecessors, (221), 0 states have call successors, (0), 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-09 04:34:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2024-11-09 04:34:05,285 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 30 [2024-11-09 04:34:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2024-11-09 04:34:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 04:34:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2024-11-09 04:34:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 04:34:05,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:05,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 04:34:05,287 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:34:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1182935324, now seen corresponding path program 1 times [2024-11-09 04:34:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898230680] [2024-11-09 04:34:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:05,492 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-09 04:34:05,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898230680] [2024-11-09 04:34:05,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898230680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:34:05,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:34:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:34:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366489164] [2024-11-09 04:34:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:34:05,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:34:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:34:05,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:34:05,494 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 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-09 04:34:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:05,702 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2024-11-09 04:34:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:34:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 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 31 [2024-11-09 04:34:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:05,703 INFO L225 Difference]: With dead ends: 202 [2024-11-09 04:34:05,704 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 04:34:05,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:34:05,704 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 110 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:05,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 160 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:34:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 04:34:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 187. [2024-11-09 04:34:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 168 states have (on average 1.3035714285714286) internal successors, (219), 186 states have internal predecessors, (219), 0 states have call successors, (0), 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-09 04:34:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2024-11-09 04:34:05,709 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 31 [2024-11-09 04:34:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:05,710 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2024-11-09 04:34:05,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 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-09 04:34:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2024-11-09 04:34:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 04:34:05,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:05,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:34:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 04:34:05,711 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:34:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1893980872, now seen corresponding path program 1 times [2024-11-09 04:34:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943607809] [2024-11-09 04:34:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:34:06,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943607809] [2024-11-09 04:34:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943607809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751424720] [2024-11-09 04:34:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:06,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:06,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:34:06,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:34:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:06,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 04:34:06,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:07,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:34:07,102 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:34:07,103 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-09 04:34:07,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:34:07,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-09 04:34:07,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2024-11-09 04:34:07,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 0 case distinctions, treesize of input 39 treesize of output 19 [2024-11-09 04:34:07,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-09 04:34:08,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:08,004 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:34:08,011 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-09 04:34:08,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 46 [2024-11-09 04:34:08,113 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 27 treesize of output 11 [2024-11-09 04:34:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:34:08,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:34:08,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 04:34:09,094 INFO L349 Elim1Store]: treesize reduction 364, result has 41.6 percent of original size [2024-11-09 04:34:09,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3375 treesize of output 1754 [2024-11-09 04:34:09,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:34:09,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 4805 treesize of output 4687 [2024-11-09 04:34:22,104 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-09 04:34:23,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:34:23,113 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 33 treesize of output 37 [2024-11-09 04:34:32,459 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 27 [2024-11-09 04:34:32,528 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:34:32,879 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-09 04:34:33,609 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-09 04:34:33,653 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:34:33,653 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 102 treesize of output 98 [2024-11-09 04:34:34,140 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:34:34,176 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 27 [2024-11-09 04:34:34,516 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 27 [2024-11-09 04:34:34,564 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:34:40,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:34:40,603 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 1971 treesize of output 1907 [2024-11-09 04:34:59,926 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-09 04:34:59,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1886 treesize of output 1892 [2024-11-09 04:35:13,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:13,630 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 41 treesize of output 45 [2024-11-09 04:35:16,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:16,004 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 61 treesize of output 65 [2024-11-09 04:35:16,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:16,364 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 30 treesize of output 34 [2024-11-09 04:35:19,529 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 56 treesize of output 52 [2024-11-09 04:35:19,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:19,595 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 22 treesize of output 26 [2024-11-09 04:35:19,667 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 63 treesize of output 57 [2024-11-09 04:35:20,735 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 04:35:20,736 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 85 treesize of output 76 [2024-11-09 04:35:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-09 04:35:20,842 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 27 [2024-11-09 04:35:20,867 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 41 treesize of output 37 [2024-11-09 04:35:20,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:20,945 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 78 treesize of output 74 [2024-11-09 04:35:21,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:21,057 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 74 treesize of output 72 [2024-11-09 04:35:21,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35: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 71 treesize of output 69 [2024-11-09 04:35:21,306 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 31 treesize of output 25 [2024-11-09 04:35:21,386 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 138 treesize of output 124 [2024-11-09 04:35:21,500 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-09 04:35:21,500 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 108 treesize of output 1 [2024-11-09 04:35:21,519 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 155 treesize of output 147 [2024-11-09 04:35:21,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:21,911 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 250 treesize of output 246 [2024-11-09 04:35:22,419 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-09 04:35:22,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1001 treesize of output 909 [2024-11-09 04:35:25,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:25,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:35:25,903 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-09 04:35:25,904 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 91 treesize of output 82 [2024-11-09 04:35:25,955 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:35:25,966 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:35:26,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 8 treesize of output 6 [2024-11-09 04:35:26,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:26,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 04:35:26,044 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:35:26,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:26,128 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-11-09 04:35:26,156 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:35:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:26,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-09 04:35:26,198 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:35:26,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:26,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 04:35:26,299 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2024-11-09 04:35:26,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 286 treesize of output 290 [2024-11-09 04:35:26,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:26,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 04:35:26,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:26,676 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 46 treesize of output 50 [2024-11-09 04:35:29,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:35:29,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 285 treesize of output 1211 [2024-11-09 04:38:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:38:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751424720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:38:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1403580648] [2024-11-09 04:38:51,598 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 04:38:51,598 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:38:51,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:38:51,599 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:38:51,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:39:00,708 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:39:34,865 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10047#(and (exists ((|v_#valid_129| (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.base_30| Int)) (and (<= 2 |v_ULTIMATE.start_main_~#list~0#1.base_30|) (= (store |v_#valid_129| |v_ULTIMATE.start_main_~#list~0#1.base_30| 0) |#valid|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (= (select |v_#valid_129| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#list~0#1.base_30|)) (or (and (exists ((|v_ULTIMATE.start_create_data_#t~nondet3#1_22| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_data_#t~nondet3#1_22| 2147483648)) (not (= |v_ULTIMATE.start_create_data_#t~nondet3#1_22| 0)) (<= |v_ULTIMATE.start_create_data_#t~nondet3#1_22| 2147483647))) (exists ((|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_ULTIMATE.start_append_~pointerToList#1.base_23| Int) (|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (and (<= 4 (select |#length| |v_ULTIMATE.start_append_~pointerToList#1.base_23|)) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23| (store (select (store |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.offset_119| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0 0))) (= |v_#memory_int_98| (store |v_#memory_int_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_int_97| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 (select (select |v_#memory_int_98| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0)))) (<= 2 |v_ULTIMATE.start_append_~pointerToList#1.base_23|) (= (select |v_#valid_129| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0))) (= (select |v_#valid_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 1) (= (store (store |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23| (store (select (store |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0) (store (select |v_#memory_$Pointer$.base_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_98| |v_ULTIMATE.start_append_~pointerToList#1.base_23| (store (select |v_#memory_int_98| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0 (select (select |#memory_int| |v_ULTIMATE.start_append_~pointerToList#1.base_23|) 0))))))) (and (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_22| Int) (|v_ULTIMATE.start_main_#t~mem18#1.offset_21| Int) (|v_#valid_128| (Array Int Int)) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_132| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 1) |#StackHeapBarrier|) (= |v_#valid_129| (store |v_#valid_128| (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0)) (= (select |v_#valid_128| |v_ULTIMATE.start_main_#t~mem18#1.base_22|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_#t~mem18#1.base_22|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_21| 4))))) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))) (<= (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_21| 8) (select |#length| |v_ULTIMATE.start_main_#t~mem18#1.base_22|)) (= (select (select |v_#memory_$Pointer$.offset_122| (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (= (select (select |v_#memory_$Pointer$.base_132| (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_main_#t~mem18#1.base_22|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_21| 4))))) (= (select |v_#valid_128| (select (select |v_#memory_$Pointer$.base_132| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 1) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_21| 4)))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_100| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_int_100| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |#memory_int| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0))) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 04:39:34,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:39:34,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:39:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2024-11-09 04:39:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036842683] [2024-11-09 04:39:34,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:39:34,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 04:39:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:39:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 04:39:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3871, Unknown=26, NotChecked=0, Total=4160 [2024-11-09 04:39:34,868 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 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-09 04:39:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:39:40,062 INFO L93 Difference]: Finished difference Result 271 states and 307 transitions. [2024-11-09 04:39:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 04:39:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 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-09 04:39:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:39:40,064 INFO L225 Difference]: With dead ends: 271 [2024-11-09 04:39:40,064 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 04:39:40,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=664, Invalid=6792, Unknown=26, NotChecked=0, Total=7482 [2024-11-09 04:39:40,066 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 350 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:39:40,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 990 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 04:39:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 04:39:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 195. [2024-11-09 04:39:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 176 states have (on average 1.2897727272727273) internal successors, (227), 194 states have internal predecessors, (227), 0 states have call successors, (0), 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-09 04:39:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 227 transitions. [2024-11-09 04:39:40,074 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 227 transitions. Word has length 34 [2024-11-09 04:39:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:39:40,075 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 227 transitions. [2024-11-09 04:39:40,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 41 states have internal predecessors, (93), 0 states have call successors, (0), 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-09 04:39:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 227 transitions. [2024-11-09 04:39:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 04:39:40,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:39:40,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:39:40,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 04:39:40,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:40,281 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:39:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:39:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1893980900, now seen corresponding path program 1 times [2024-11-09 04:39:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:39:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356138301] [2024-11-09 04:39:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:39:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:39:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:39:41,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:39:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356138301] [2024-11-09 04:39:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356138301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:39:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930595350] [2024-11-09 04:39:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:39:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:39:41,463 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:39:41,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:39:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:41,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 04:39:41,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:39:41,708 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-09 04:39:41,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:39:41,963 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-09 04:39:41,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 04:39:42,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 04:39:42,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-09 04:39:42,473 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 0 case distinctions, treesize of input 52 treesize of output 28 [2024-11-09 04:39:42,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-09 04:39:43,023 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 04:39:43,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2024-11-09 04:39:43,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:43,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 31 [2024-11-09 04:39:43,258 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 36 treesize of output 16 [2024-11-09 04:39:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:39:43,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:39:43,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 04:39:45,673 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 48 treesize of output 44 [2024-11-09 04:39:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:39:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930595350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:39:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1863332710] [2024-11-09 04:39:46,363 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 04:39:46,363 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:39:46,363 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:39:46,364 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:39:46,364 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:39:51,637 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:40:36,957 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10818#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_29| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~mem18#1.base_29|) 1))))' at error location [2024-11-09 04:40:36,957 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:40:36,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:40:36,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2024-11-09 04:40:36,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943655273] [2024-11-09 04:40:36,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:40:36,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 04:40:36,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:40:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 04:40:36,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=3317, Unknown=25, NotChecked=0, Total=3660 [2024-11-09 04:40:36,960 INFO L87 Difference]: Start difference. First operand 195 states and 227 transitions. Second operand has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 04:40:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:40:39,487 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2024-11-09 04:40:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 04:40:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 04:40:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:40:39,489 INFO L225 Difference]: With dead ends: 253 [2024-11-09 04:40:39,489 INFO L226 Difference]: Without dead ends: 253 [2024-11-09 04:40:39,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=553, Invalid=4972, Unknown=25, NotChecked=0, Total=5550 [2024-11-09 04:40:39,491 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 279 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:40:39,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 871 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 04:40:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-09 04:40:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 197. [2024-11-09 04:40:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 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-09 04:40:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2024-11-09 04:40:39,497 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 34 [2024-11-09 04:40:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:40:39,498 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2024-11-09 04:40:39,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 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-09 04:40:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2024-11-09 04:40:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 04:40:39,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:40:39,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:40:39,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 04:40:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 04:40:39,704 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:40:39,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:40:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1893980899, now seen corresponding path program 1 times [2024-11-09 04:40:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:40:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080363748] [2024-11-09 04:40:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:40:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:40:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:40:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:40:41,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:40:41,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080363748] [2024-11-09 04:40:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080363748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:40:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477908230] [2024-11-09 04:40:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:40:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:40:41,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:40:41,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:40:41,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:40:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:40:42,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-09 04:40:42,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:40:42,100 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-09 04:40:42,118 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-09 04:40:42,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:40:42,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:40:42,450 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 04:40:42,450 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 21 [2024-11-09 04:40:42,488 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-09 04:40:42,489 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-09 04:40:42,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:40:42,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:40:42,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:40:42,756 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 04:40:42,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-09 04:40:43,002 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 30 treesize of output 21 [2024-11-09 04:40:43,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 04:40:43,129 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 0 case distinctions, treesize of input 52 treesize of output 28 [2024-11-09 04:40:43,139 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-09 04:40:44,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:40:44,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:40:44,100 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:40:44,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 63 [2024-11-09 04:40:44,108 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 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 04:40:44,372 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:40:44,373 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 04:40:44,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 04:40:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:40:44,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:40:44,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1290 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1290))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< (+ (select (select .cse0 .cse1) 4) 7) (select |c_#length| (select (select .cse2 .cse1) 4)))))) (forall ((v_ArrVal_1290 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1290))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< 0 (+ (select (select .cse3 .cse1) 4) 5)))))))) is different from false [2024-11-09 04:40:45,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) (and (forall ((v_ArrVal_1290 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1290))) (or (< 0 (+ 5 (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 4))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))) (forall ((v_ArrVal_1290 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1290))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (< (+ 7 (select (select .cse4 .cse5) 4)) (select |c_#length| (select (select .cse6 .cse5) 4)))))))))) is different from false [2024-11-09 04:40:45,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_append_~node~0#1.offset| 4))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.base|)) (.cse5 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.offset|))) (and (forall ((v_ArrVal_1290 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse5 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1290))) (or (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse3 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse3 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (< (+ 7 (select (select .cse0 .cse1) 4)) (select |c_#length| (select (select .cse2 .cse1) 4))))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))) (forall ((v_ArrVal_1290 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse5 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1290))) (or (< 0 (+ (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 4) 5)) (not (= (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))))) is different from false [2024-11-09 04:40:46,190 INFO L349 Elim1Store]: treesize reduction 240, result has 37.0 percent of original size [2024-11-09 04:40:46,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 192 treesize of output 288 [2024-11-09 04:40:46,530 INFO L349 Elim1Store]: treesize reduction 240, result has 37.0 percent of original size [2024-11-09 04:40:46,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 246 treesize of output 284 [2024-11-09 04:40:46,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:46,627 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 456 treesize of output 456 [2024-11-09 04:40:47,065 INFO L349 Elim1Store]: treesize reduction 292, result has 41.6 percent of original size [2024-11-09 04:40:47,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 275 treesize of output 437 [2024-11-09 04:40:47,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:47,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 279 treesize of output 429 [2024-11-09 04:40:47,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:47,386 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 221 treesize of output 217 [2024-11-09 04:40:47,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 6 treesize of output 4 [2024-11-09 04:40:48,622 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 15 treesize of output 11 [2024-11-09 04:40:49,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:49,737 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 61 treesize of output 71 [2024-11-09 04:40:50,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 04:40:50,232 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-09 04:40:51,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 04:40:51,231 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-09 04:40:51,280 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:40:51,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:51,680 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 57 treesize of output 75 [2024-11-09 04:40:52,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:52,021 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 24 treesize of output 28 [2024-11-09 04:40:52,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:40:52,183 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-09 04:40:52,600 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:40:52,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:40:52,664 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 04:40:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:40:52,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-09 04:40:54,146 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 36 treesize of output 30 [2024-11-09 04:40:54,415 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 15 treesize of output 11 [2024-11-09 04:40:54,570 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-09 04:40:54,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 6 treesize of output 4 [2024-11-09 04:40:55,234 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 36 treesize of output 30 [2024-11-09 04:40:55,384 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 15 treesize of output 11 [2024-11-09 04:40:56,127 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 36 treesize of output 30 [2024-11-09 04:40:56,317 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 15 treesize of output 11 [2024-11-09 04:40:56,457 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-09 04:40:57,079 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 29 treesize of output 23 [2024-11-09 04:40:57,187 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 29 treesize of output 23 [2024-11-09 04:40:57,401 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:40:58,001 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 36 treesize of output 30 [2024-11-09 04:40:58,232 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 15 treesize of output 11 [2024-11-09 04:40:58,401 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-09 04:41:00,503 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 36 treesize of output 30 [2024-11-09 04:41:00,899 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 36 treesize of output 30 [2024-11-09 04:41:04,061 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 36 treesize of output 30 [2024-11-09 04:41:04,497 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 36 treesize of output 30 [2024-11-09 04:41:04,793 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 36 treesize of output 30 [2024-11-09 04:41:05,231 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 29 treesize of output 23 [2024-11-09 04:41:05,646 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 36 treesize of output 30 [2024-11-09 04:41:08,212 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 36 treesize of output 30 [2024-11-09 04:41:08,561 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 36 treesize of output 30 [2024-11-09 04:41:08,786 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 04:41:09,313 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 62 treesize of output 54 [2024-11-09 04:41:09,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:09,506 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 35 treesize of output 45 [2024-11-09 04:41:19,322 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-09 04:41:19,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-09 04:41:19,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [789388669] [2024-11-09 04:41:19,326 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 04:41:19,326 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:41:19,326 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:41:19,326 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:41:19,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:41:19,333 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-09 04:41:19,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:41:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-09 04:41:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147533382] [2024-11-09 04:41:19,341 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 04:41:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 04:41:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:41:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 04:41:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1564, Unknown=3, NotChecked=246, Total=1980 [2024-11-09 04:41:19,343 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:19,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=167, Invalid=1564, Unknown=3, NotChecked=246, Total=1980 [2024-11-09 04:41:19,347 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-09 04:41:19,348 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-09 04:41:19,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:19,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 04:41:19,549 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_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-09 04:41:19,551 INFO L158 Benchmark]: Toolchain (without parser) took 558672.99ms. Allocated memory was 134.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 93.2MB in the beginning and 956.6MB in the end (delta: -863.4MB). Peak memory consumption was 563.8MB. Max. memory is 16.1GB. [2024-11-09 04:41:19,552 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 134.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:41:19,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.34ms. Allocated memory is still 134.2MB. Free memory was 92.8MB in the beginning and 73.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 04:41:19,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.95ms. Allocated memory is still 134.2MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:41:19,552 INFO L158 Benchmark]: Boogie Preprocessor took 57.33ms. Allocated memory is still 134.2MB. Free memory was 70.9MB in the beginning and 69.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:41:19,552 INFO L158 Benchmark]: RCFGBuilder took 763.40ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 69.3MB in the beginning and 125.0MB in the end (delta: -55.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-11-09 04:41:19,553 INFO L158 Benchmark]: TraceAbstraction took 557165.69ms. Allocated memory was 169.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 124.0MB in the beginning and 956.6MB in the end (delta: -832.6MB). Peak memory consumption was 556.8MB. Max. memory is 16.1GB. [2024-11-09 04:41:19,555 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.24ms. Allocated memory is still 134.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.34ms. Allocated memory is still 134.2MB. Free memory was 92.8MB in the beginning and 73.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.95ms. Allocated memory is still 134.2MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.33ms. Allocated memory is still 134.2MB. Free memory was 70.9MB in the beginning and 69.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 763.40ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 69.3MB in the beginning and 125.0MB in the end (delta: -55.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 557165.69ms. Allocated memory was 169.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 124.0MB in the beginning and 956.6MB in the end (delta: -832.6MB). Peak memory consumption was 556.8MB. 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_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:41:22,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:41:22,295 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 04:41:22,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:41:22,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:41:22,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:41:22,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:41:22,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:41:22,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:41:22,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:41:22,357 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:41:22,357 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:41:22,358 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:41:22,358 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:41:22,359 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:41:22,363 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:41:22,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:41:22,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:41:22,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:41:22,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:41:22,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:41:22,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:41:22,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:41:22,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:41:22,372 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:41:22,372 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:41:22,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:41:22,373 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:41:22,373 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:41:22,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:41:22,374 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:41:22,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:41:22,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:41:22,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:41:22,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:41:22,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:41:22,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:41:22,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:41:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:41:22,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:41:22,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:41:22,379 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:41:22,379 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:41:22,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:41:22,391 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:41:22,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-09 04:41:22,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:41:22,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:41:22,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:41:22,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:41:22,939 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:41:22,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i Unable to find full path for "g++" [2024-11-09 04:41:25,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:41:25,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:41:25,923 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-09 04:41:25,940 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data/6c643fdb6/0b7390ec00b64c938b841b191f6c040c/FLAGe4f6196ba [2024-11-09 04:41:25,954 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/data/6c643fdb6/0b7390ec00b64c938b841b191f6c040c [2024-11-09 04:41:25,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:41:25,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:41:25,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:41:25,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:41:25,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:41:25,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:41:25" (1/1) ... [2024-11-09 04:41:25,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4093b32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:25, skipping insertion in model container [2024-11-09 04:41:25,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:41:25" (1/1) ... [2024-11-09 04:41:26,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:41:26,414 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:41:26,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:41:26,493 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:41:26,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:41:26,631 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:41:26,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26 WrapperNode [2024-11-09 04:41:26,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:41:26,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:41:26,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:41:26,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:41:26,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,693 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2024-11-09 04:41:26,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:41:26,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:41:26,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:41:26,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:41:26,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:41:26,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:41:26,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:41:26,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:41:26,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (1/1) ... [2024-11-09 04:41:26,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:41:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:41:26,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:41:26,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 04:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:41:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:41:26,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:41:26,980 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:41:26,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:41:27,690 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 04:41:27,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:41:27,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:41:27,717 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 04:41:27,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:41:27 BoogieIcfgContainer [2024-11-09 04:41:27,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:41:27,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:41:27,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:41:27,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:41:27,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:41:25" (1/3) ... [2024-11-09 04:41:27,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c7ca76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:41:27, skipping insertion in model container [2024-11-09 04:41:27,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:41:26" (2/3) ... [2024-11-09 04:41:27,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c7ca76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:41:27, skipping insertion in model container [2024-11-09 04:41:27,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:41:27" (3/3) ... [2024-11-09 04:41:27,729 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-09 04:41:27,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:41:27,755 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-09 04:41:27,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:41:27,835 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;@5b5a8704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:41:27,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 04:41:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 55 states have (on average 2.018181818181818) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 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-09 04:41:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:41:27,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:27,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:41:27,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:27,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-09 04:41:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620330530] [2024-11-09 04:41:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:27,878 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-09 04:41:27,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:27,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:27,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:28,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:41:28,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:28,143 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-09 04:41:28,217 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 04:41:28,218 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-09 04:41:28,267 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-09 04:41:28,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:28,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620330530] [2024-11-09 04:41:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620330530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:28,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:28,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:41:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261528374] [2024-11-09 04:41:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:41:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:28,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:41:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:41:28,310 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 2.018181818181818) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 04:41:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:28,790 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-09 04:41:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:41:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 04:41:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:28,807 INFO L225 Difference]: With dead ends: 105 [2024-11-09 04:41:28,807 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 04:41:28,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:28,817 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 121 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:28,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 96 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:41:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 04:41:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-09 04:41:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.875) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 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-09 04:41:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-09 04:41:28,876 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 4 [2024-11-09 04:41:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:28,879 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-09 04:41:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 04:41:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-09 04:41:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:41:28,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:28,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:41:28,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:29,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:29,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-09 04:41:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474827829] [2024-11-09 04:41:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:29,086 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-09 04:41:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:29,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:29,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:29,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:41:29,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:29,223 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-09 04:41:29,239 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-09 04:41:29,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:29,359 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-09 04:41:29,378 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:29,379 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-09 04:41:29,408 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-09 04:41:29,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:29,408 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474827829] [2024-11-09 04:41:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474827829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:41:29,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132307370] [2024-11-09 04:41:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:29,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:41:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:41:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:41:29,413 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 04:41:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:30,059 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2024-11-09 04:41:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:41:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 04:41:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:30,062 INFO L225 Difference]: With dead ends: 143 [2024-11-09 04:41:30,062 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 04:41:30,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:30,064 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 99 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:30,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 113 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:41:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 04:41:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2024-11-09 04:41:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.7887323943661972) internal successors, (127), 110 states have internal predecessors, (127), 0 states have call successors, (0), 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-09 04:41:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2024-11-09 04:41:30,086 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 4 [2024-11-09 04:41:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2024-11-09 04:41:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 04:41:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2024-11-09 04:41:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:41:30,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:30,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:41:30,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-09 04:41:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413800925] [2024-11-09 04:41:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:30,305 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-09 04:41:30,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:30,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:30,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:41:30,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:30,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 04:41:30,408 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-09 04:41:30,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:30,408 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413800925] [2024-11-09 04:41:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413800925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:41:30,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226431671] [2024-11-09 04:41:30,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:30,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:41:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:41:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:41:30,413 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-09 04:41:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:30,618 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-09 04:41:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:41:30,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-09 04:41:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:30,620 INFO L225 Difference]: With dead ends: 109 [2024-11-09 04:41:30,621 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 04:41:30,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 04:41:30,623 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:30,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 114 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:41:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 04:41:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 04:41:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 108 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 04:41:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-11-09 04:41:30,633 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 5 [2024-11-09 04:41:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-11-09 04:41:30,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-09 04:41:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-11-09 04:41:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:41:30,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:30,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:41:30,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:30,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-09 04:41:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764966561] [2024-11-09 04:41:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:30,840 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-09 04:41:30,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:30,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:30,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:41:30,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:30,945 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-09 04:41:30,978 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-09 04:41:30,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:30,979 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764966561] [2024-11-09 04:41:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764966561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:30,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:41:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295759413] [2024-11-09 04:41:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:30,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:41:30,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:41:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:41:30,982 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-09 04:41:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:31,286 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-11-09 04:41:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:41:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-09 04:41:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:31,288 INFO L225 Difference]: With dead ends: 118 [2024-11-09 04:41:31,288 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 04:41:31,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 04:41:31,290 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:31,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:41:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 04:41:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2024-11-09 04:41:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.6973684210526316) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 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-09 04:41:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2024-11-09 04:41:31,309 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 5 [2024-11-09 04:41:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:31,310 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2024-11-09 04:41:31,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-09 04:41:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2024-11-09 04:41:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 04:41:31,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:31,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:31,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:31,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:31,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 234240045, now seen corresponding path program 1 times [2024-11-09 04:41:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031628841] [2024-11-09 04:41:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:31,514 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-09 04:41:31,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:31,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:31,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:31,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:41:31,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:31,609 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-09 04:41:31,622 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-09 04:41:31,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:31,622 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031628841] [2024-11-09 04:41:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031628841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:41:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982429251] [2024-11-09 04:41:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:41:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:41:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:41:31,626 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:31,862 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-09 04:41:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:41:31,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 04:41:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:31,867 INFO L225 Difference]: With dead ends: 109 [2024-11-09 04:41:31,867 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 04:41:31,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-09 04:41:31,869 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:31,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:41:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 04:41:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 04:41:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.631578947368421) internal successors, (124), 108 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 04:41:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-11-09 04:41:31,891 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 9 [2024-11-09 04:41:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:31,891 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-11-09 04:41:31,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-11-09 04:41:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 04:41:31,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:31,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:31,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash 234240046, now seen corresponding path program 1 times [2024-11-09 04:41:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:32,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322680455] [2024-11-09 04:41:32,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:32,096 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-09 04:41:32,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:32,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:32,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:41:32,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:32,199 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-09 04:41:32,224 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-09 04:41:32,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:32,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322680455] [2024-11-09 04:41:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322680455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:32,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:32,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:41:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875584415] [2024-11-09 04:41:32,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:32,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:41:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:41:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:41:32,228 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:32,482 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-11-09 04:41:32,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:41:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 04:41:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:32,484 INFO L225 Difference]: With dead ends: 108 [2024-11-09 04:41:32,484 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 04:41:32,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-09 04:41:32,485 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 140 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:32,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 140 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:41:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 04:41:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 04:41:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.605263157894737) internal successors, (122), 107 states have internal predecessors, (122), 0 states have call successors, (0), 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-09 04:41:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-11-09 04:41:32,492 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 9 [2024-11-09 04:41:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:32,493 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-11-09 04:41:32,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-11-09 04:41:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 04:41:32,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:32,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:32,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:41:32,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:32,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2024-11-09 04:41:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482836252] [2024-11-09 04:41:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:32,704 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-09 04:41:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:32,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:32,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:41:32,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:32,835 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-09 04:41:32,844 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-09 04:41:32,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:32,895 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-09 04:41:32,917 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:32,917 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-09 04:41:32,936 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-09 04:41:32,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:32,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482836252] [2024-11-09 04:41:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482836252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:41:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247427702] [2024-11-09 04:41:32,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:32,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:41:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:41:32,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:41:32,939 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:33,188 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2024-11-09 04:41:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:41:33,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 04:41:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:33,190 INFO L225 Difference]: With dead ends: 105 [2024-11-09 04:41:33,190 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 04:41:33,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:41:33,192 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:33,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 122 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:41:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 04:41:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 04:41:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.5657894736842106) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 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-09 04:41:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2024-11-09 04:41:33,205 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 9 [2024-11-09 04:41:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2024-11-09 04:41:33,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2024-11-09 04:41:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:41:33,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:33,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:33,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 04:41:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:33,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:33,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1430796723, now seen corresponding path program 1 times [2024-11-09 04:41:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375449743] [2024-11-09 04:41:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:33,412 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-09 04:41:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:33,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:33,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:33,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:41:33,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:33,536 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-09 04:41:33,568 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-09 04:41:33,613 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 23 treesize of output 11 [2024-11-09 04:41:33,633 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-09 04:41:33,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:33,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:33,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375449743] [2024-11-09 04:41:33,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375449743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:33,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:33,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:41:33,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978318085] [2024-11-09 04:41:33,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:33,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:33,636 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:41:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:34,126 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2024-11-09 04:41:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:41:34,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:41:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:34,128 INFO L225 Difference]: With dead ends: 115 [2024-11-09 04:41:34,128 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 04:41:34,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-09 04:41:34,129 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 7 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:34,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 233 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:41:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 04:41:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-09 04:41:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 109 states have internal predecessors, (127), 0 states have call successors, (0), 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-09 04:41:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2024-11-09 04:41:34,143 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 15 [2024-11-09 04:41:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:34,143 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2024-11-09 04:41:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:41:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2024-11-09 04:41:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 04:41:34,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:34,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:34,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:34,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:34,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:34,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1430796724, now seen corresponding path program 1 times [2024-11-09 04:41:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:34,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606886960] [2024-11-09 04:41:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:34,346 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-09 04:41:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:34,350 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:34,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 04:41:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:34,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 04:41:34,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:34,458 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-09 04:41:34,494 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-09 04:41:34,501 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-09 04:41:34,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 04:41:34,688 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-09 04:41:34,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:34,689 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:34,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606886960] [2024-11-09 04:41:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606886960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:34,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:34,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:41:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795265025] [2024-11-09 04:41:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:41:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:41:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:41:34,691 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:41:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:35,181 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2024-11-09 04:41:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:41:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:35,183 INFO L225 Difference]: With dead ends: 110 [2024-11-09 04:41:35,183 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 04:41:35,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:35,184 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:35,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 231 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:41:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 04:41:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 04:41:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 109 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 04:41:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-09 04:41:35,190 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 15 [2024-11-09 04:41:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:35,190 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-09 04:41:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 04:41:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-09 04:41:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 04:41:35,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:35,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:35,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 04:41:35,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:35,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:35,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash -522360048, now seen corresponding path program 1 times [2024-11-09 04:41:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023096844] [2024-11-09 04:41:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:35,395 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-09 04:41:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:35,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:35,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 04:41:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:35,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:41:35,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:35,653 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-09 04:41:35,686 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:35,686 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-09 04:41:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:41:35,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:35,776 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:35,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023096844] [2024-11-09 04:41:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023096844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:35,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:41:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106245346] [2024-11-09 04:41:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:35,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:41:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:41:35,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:41:35,778 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-09 04:41:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:36,112 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-11-09 04:41:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:41:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-09 04:41:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:36,113 INFO L225 Difference]: With dead ends: 109 [2024-11-09 04:41:36,114 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 04:41:36,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:41:36,114 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:36,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 176 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:41:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 04:41:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2024-11-09 04:41:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 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-09 04:41:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2024-11-09 04:41:36,123 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 16 [2024-11-09 04:41:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:36,123 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2024-11-09 04:41:36,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-09 04:41:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2024-11-09 04:41:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 04:41:36,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:36,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:36,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:36,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:36,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 576760149, now seen corresponding path program 1 times [2024-11-09 04:41:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974420687] [2024-11-09 04:41:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:36,326 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-09 04:41:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:36,327 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:36,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:36,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 04:41:36,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:36,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:41:36,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 04:41:36,598 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-09 04:41:36,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:36,599 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974420687] [2024-11-09 04:41:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974420687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:36,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:41:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315193644] [2024-11-09 04:41:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:36,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:36,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:36,601 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:37,020 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2024-11-09 04:41:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 04:41:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:37,023 INFO L225 Difference]: With dead ends: 140 [2024-11-09 04:41:37,023 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 04:41:37,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:37,024 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 65 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:37,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 234 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:41:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 04:41:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2024-11-09 04:41:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 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-09 04:41:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-09 04:41:37,032 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 17 [2024-11-09 04:41:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-09 04:41:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-09 04:41:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 04:41:37,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:37,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:37,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:37,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:37,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:37,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 576760121, now seen corresponding path program 1 times [2024-11-09 04:41:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445943994] [2024-11-09 04:41:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:37,237 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-09 04:41:37,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:37,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:37,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 04:41:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:37,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:41:37,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:37,371 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-09 04:41:37,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:41:37,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 04:41:37,577 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-09 04:41:37,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:37,578 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445943994] [2024-11-09 04:41:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445943994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:41:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438839898] [2024-11-09 04:41:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:37,580 INFO L87 Difference]: Start difference. First operand 105 states and 118 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-09 04:41:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:38,152 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-09 04:41:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:38,153 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 17 [2024-11-09 04:41:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:38,154 INFO L225 Difference]: With dead ends: 136 [2024-11-09 04:41:38,154 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 04:41:38,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:38,155 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:38,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:41:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 04:41:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-09 04:41:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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-09 04:41:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-11-09 04:41:38,160 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2024-11-09 04:41:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:38,160 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-11-09 04:41:38,160 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-09 04:41:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-11-09 04:41:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 04:41:38,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:38,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:38,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 04:41:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:38,365 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 576760122, now seen corresponding path program 1 times [2024-11-09 04:41:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897980012] [2024-11-09 04:41:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:38,367 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-09 04:41:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:38,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:38,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 04:41:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:38,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 04:41:38,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:38,534 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-09 04:41:38,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:41:38,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:41:38,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 04:41:38,864 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-09 04:41:38,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:38,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897980012] [2024-11-09 04:41:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897980012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:38,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:38,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:41:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881038041] [2024-11-09 04:41:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:38,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:38,868 INFO L87 Difference]: Start difference. First operand 105 states and 117 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-09 04:41:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:39,501 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2024-11-09 04:41:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:39,502 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 17 [2024-11-09 04:41:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:39,503 INFO L225 Difference]: With dead ends: 153 [2024-11-09 04:41:39,503 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 04:41:39,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:39,504 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:39,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 216 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:41:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 04:41:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2024-11-09 04:41:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 112 states have internal predecessors, (126), 0 states have call successors, (0), 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-09 04:41:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2024-11-09 04:41:39,511 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 17 [2024-11-09 04:41:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:39,512 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2024-11-09 04:41:39,512 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-09 04:41:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2024-11-09 04:41:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:41:39,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:39,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:39,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 04:41:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:39,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:39,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1903323991, now seen corresponding path program 1 times [2024-11-09 04:41:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319903220] [2024-11-09 04:41:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:39,719 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-09 04:41:39,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:39,720 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:39,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:39,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:41:39,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:39,872 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-09 04:41:40,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:41:40,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 04:41:40,064 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-09 04:41:40,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:40,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319903220] [2024-11-09 04:41:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319903220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:40,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:41:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881093000] [2024-11-09 04:41:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:40,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:40,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:40,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:40,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:40,067 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 04:41:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:40,611 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2024-11-09 04:41:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:40,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 04:41:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:40,612 INFO L225 Difference]: With dead ends: 143 [2024-11-09 04:41:40,613 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 04:41:40,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:40,614 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:40,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 176 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:41:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 04:41:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 113. [2024-11-09 04:41:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 112 states have internal predecessors, (125), 0 states have call successors, (0), 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-09 04:41:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-09 04:41:40,619 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 20 [2024-11-09 04:41:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:40,619 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-09 04:41:40,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 04:41:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-11-09 04:41:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:41:40,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:40,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:40,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:40,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:40,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1903323990, now seen corresponding path program 1 times [2024-11-09 04:41:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854108742] [2024-11-09 04:41:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:40,822 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-09 04:41:40,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:40,824 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:40,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 04:41:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:40,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 04:41:40,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:40,986 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-09 04:41:41,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:41:41,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:41:41,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 04:41:41,309 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-09 04:41:41,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:41,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854108742] [2024-11-09 04:41:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854108742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:41:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273536468] [2024-11-09 04:41:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:41,315 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 04:41:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:41,982 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-09 04:41:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 04:41:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:41,984 INFO L225 Difference]: With dead ends: 151 [2024-11-09 04:41:41,984 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 04:41:41,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:41,985 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:41,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 217 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:41:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 04:41:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2024-11-09 04:41:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 115 states have internal predecessors, (128), 0 states have call successors, (0), 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-09 04:41:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-11-09 04:41:41,994 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 20 [2024-11-09 04:41:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-11-09 04:41:41,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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-09 04:41:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-11-09 04:41:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:41:41,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:41,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:42,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 04:41:42,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:42,196 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:42,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1813848920, now seen corresponding path program 1 times [2024-11-09 04:41:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171927754] [2024-11-09 04:41:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:42,198 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-09 04:41:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:42,202 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:42,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 04:41:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:42,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:41:42,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:42,348 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-09 04:41:42,389 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:41:42,389 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-09 04:41:42,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:41:42,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:42,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 04:41:42,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 04:41:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:41:42,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:42,896 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2024-11-09 04:41:42,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:42,932 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 26 treesize of output 27 [2024-11-09 04:41:42,937 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 44 treesize of output 32 [2024-11-09 04:41:42,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 11 treesize of output 7 [2024-11-09 04:41:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 04:41:45,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171927754] [2024-11-09 04:41:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171927754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:41:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1130940356] [2024-11-09 04:41:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:45,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:41:45,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:41:45,070 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:41:45,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-09 04:41:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:45,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 04:41:45,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:45,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 04:41:45,401 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:41:45,402 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-09 04:41:45,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:41:45,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:45,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 04:41:45,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 04:41:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:41:45,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:45,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:45,782 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 26 treesize of output 27 [2024-11-09 04:41:45,786 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 44 treesize of output 32 [2024-11-09 04:41:45,803 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 11 treesize of output 7 [2024-11-09 04:41:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 04:41:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1130940356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:41:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439219982] [2024-11-09 04:41:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:45,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:41:45,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:41:45,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 04:41:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:45,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:41:45,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:45,977 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-09 04:41:46,004 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:41:46,005 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-09 04:41:46,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:41:46,157 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:46,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 04:41:46,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 04:41:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:41:46,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:46,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:46,403 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 26 treesize of output 27 [2024-11-09 04:41:46,410 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 44 treesize of output 32 [2024-11-09 04:41:46,426 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 11 treesize of output 7 [2024-11-09 04:41:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 04:41:46,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439219982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:41:46,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:41:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 12 [2024-11-09 04:41:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361760997] [2024-11-09 04:41:46,477 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:41:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:41:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:41:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=5, NotChecked=20, Total=156 [2024-11-09 04:41:46,479 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:47,536 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2024-11-09 04:41:47,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:47,537 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 04:41:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:47,538 INFO L225 Difference]: With dead ends: 115 [2024-11-09 04:41:47,539 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 04:41:47,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=38, Invalid=93, Unknown=5, NotChecked=20, Total=156 [2024-11-09 04:41:47,540 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 18 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:47,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 462 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 331 Invalid, 0 Unknown, 50 Unchecked, 1.0s Time] [2024-11-09 04:41:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 04:41:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 04:41:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 114 states have internal predecessors, (127), 0 states have call successors, (0), 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-09 04:41:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2024-11-09 04:41:47,551 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 21 [2024-11-09 04:41:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:47,552 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2024-11-09 04:41:47,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2024-11-09 04:41:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:41:47,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:47,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:47,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-09 04:41:47,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:47,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:48,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:48,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:48,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1813848919, now seen corresponding path program 1 times [2024-11-09 04:41:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:48,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468947433] [2024-11-09 04:41:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:48,155 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-09 04:41:48,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:48,156 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:48,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:48,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:41:48,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:48,307 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-09 04:41:48,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:41:48,348 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:48,348 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-09 04:41:48,392 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-09 04:41:48,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:41:48,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:48,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:41:48,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:41:48,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:41:48,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:41:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:41:48,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:49,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-11-09 04:41:49,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse3) (bvadd .cse0 (_ bv8 32) .cse3))))))) is different from false [2024-11-09 04:41:49,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-09 04:41:49,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 04:41:49,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:49,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:41:49,403 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-09 04:41:49,407 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-09 04:41:49,430 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-09 04:41:49,437 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 11 treesize of output 7 [2024-11-09 04:41:49,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:49,458 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 45 treesize of output 36 [2024-11-09 04:41:49,467 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 54 treesize of output 36 [2024-11-09 04:41:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 04:41:49,573 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468947433] [2024-11-09 04:41:49,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468947433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:41:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [414272158] [2024-11-09 04:41:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:41:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:41:49,575 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:41:49,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 04:41:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:49,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:41:49,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:49,830 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-09 04:41:49,843 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-09 04:41:49,862 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:49,863 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-09 04:41:49,886 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-09 04:41:49,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:41:50,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:50,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:41:50,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:41:50,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:41:50,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:41:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:41:50,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:50,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32) .cse2) (bvadd .cse0 (_ bv8 32) .cse2)))))) is different from false [2024-11-09 04:41:50,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-11-09 04:41:50,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_435) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_434) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-09 04:41:50,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:50,554 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 45 treesize of output 46 [2024-11-09 04:41:50,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:50,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:41:50,575 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-09 04:41:50,582 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-09 04:41:50,602 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-09 04:41:50,607 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 11 treesize of output 7 [2024-11-09 04:41:50,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:50,633 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 45 treesize of output 36 [2024-11-09 04:41:50,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2024-11-09 04:41:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 04:41:50,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [414272158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:41:50,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368420787] [2024-11-09 04:41:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:50,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:50,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:41:50,677 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:41:50,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 04:41:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:50,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:41:50,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:50,817 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-09 04:41:50,829 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-09 04:41:50,845 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:50,845 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-09 04:41:50,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:41:50,873 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-09 04:41:51,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:41:51,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:41:51,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:41:51,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:41:51,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:41:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:41:51,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:41:51,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1 (_ bv4 32)) (bvadd .cse2 .cse1 (_ bv8 32))))))) is different from false [2024-11-09 04:41:51,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3 (_ bv4 32)) (bvadd .cse0 .cse3 (_ bv8 32)))))))) is different from false [2024-11-09 04:41:51,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_468) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-09 04:41:51,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:51,446 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 45 treesize of output 46 [2024-11-09 04:41:51,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:51,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 04:41:51,463 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-09 04:41:51,468 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-09 04:41:51,484 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-09 04:41:51,489 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 11 treesize of output 7 [2024-11-09 04:41:51,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:41:51,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-09 04:41:51,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2024-11-09 04:41:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 04:41:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368420787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:41:51,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:41:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2024-11-09 04:41:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199737327] [2024-11-09 04:41:51,543 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:41:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 04:41:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 04:41:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=130, Unknown=9, NotChecked=270, Total=462 [2024-11-09 04:41:51,544 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 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-09 04:41:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:53,848 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2024-11-09 04:41:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:41:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 04:41:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:53,850 INFO L225 Difference]: With dead ends: 121 [2024-11-09 04:41:53,850 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 04:41:53,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=269, Unknown=9, NotChecked=378, Total=756 [2024-11-09 04:41:53,851 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 29 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:53,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 852 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 504 Unchecked, 1.7s Time] [2024-11-09 04:41:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 04:41:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 04:41:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 120 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 04:41:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2024-11-09 04:41:53,856 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 21 [2024-11-09 04:41:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2024-11-09 04:41:53,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 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-09 04:41:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2024-11-09 04:41:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 04:41:53,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:53,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:53,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:54,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:54,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:54,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:41:54,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:54,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash 233295582, now seen corresponding path program 1 times [2024-11-09 04:41:54,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295893890] [2024-11-09 04:41:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:54,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:41:54,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:54,465 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:54,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:54,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 04:41:54,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:54,620 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-09 04:41:54,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:41:54,649 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-09 04:41:54,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:41:54,831 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-09 04:41:54,923 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 31 treesize of output 19 [2024-11-09 04:41:54,939 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 31 treesize of output 19 [2024-11-09 04:41:55,245 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-09 04:41:55,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:55,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295893890] [2024-11-09 04:41:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295893890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:55,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:41:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331407205] [2024-11-09 04:41:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:55,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 04:41:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 04:41:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:41:55,247 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:58,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:41:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:58,952 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2024-11-09 04:41:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:41:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 04:41:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:58,954 INFO L225 Difference]: With dead ends: 154 [2024-11-09 04:41:58,954 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 04:41:58,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-09 04:41:58,956 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 130 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:58,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 295 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 333 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 04:41:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 04:41:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2024-11-09 04:41:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 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-09 04:41:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2024-11-09 04:41:58,961 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 23 [2024-11-09 04:41:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:58,961 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2024-11-09 04:41:58,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:41:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2024-11-09 04:41:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 04:41:58,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:58,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:58,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:59,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:59,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:41:59,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash 858722619, now seen corresponding path program 1 times [2024-11-09 04:41:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:59,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430860972] [2024-11-09 04:41:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:59,164 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-09 04:41:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:59,165 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:59,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:41:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:59,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 04:41:59,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:59,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:41:59,501 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-09 04:41:59,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:41:59,502 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:41:59,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430860972] [2024-11-09 04:41:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430860972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:41:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:41:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:41:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450755888] [2024-11-09 04:41:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:41:59,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:41:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:41:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:41:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:41:59,504 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-09 04:41:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:59,913 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2024-11-09 04:41:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:41:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 04:41:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:59,917 INFO L225 Difference]: With dead ends: 165 [2024-11-09 04:41:59,917 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 04:41:59,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:41:59,918 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 51 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:59,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:41:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 04:41:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2024-11-09 04:41:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.43801652892562) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 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-09 04:41:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2024-11-09 04:41:59,927 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 25 [2024-11-09 04:41:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:59,928 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2024-11-09 04:41:59,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-09 04:41:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2024-11-09 04:41:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 04:41:59,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:59,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:59,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:00,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:00,131 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 850597581, now seen corresponding path program 1 times [2024-11-09 04:42:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875766715] [2024-11-09 04:42:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:00,132 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-09 04:42:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:00,134 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:00,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:00,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:42:00,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:00,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:00,620 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 23 treesize of output 11 [2024-11-09 04:42:00,651 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-09 04:42:00,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:00,651 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875766715] [2024-11-09 04:42:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875766715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:00,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:00,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:42:00,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680699544] [2024-11-09 04:42:00,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:00,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:42:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:42:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:42:00,653 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-09 04:42:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:01,208 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2024-11-09 04:42:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:42:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 04:42:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:01,210 INFO L225 Difference]: With dead ends: 167 [2024-11-09 04:42:01,210 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 04:42:01,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:42:01,211 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 136 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:01,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 199 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:42:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 04:42:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2024-11-09 04:42:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 148 states have internal predecessors, (175), 0 states have call successors, (0), 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-09 04:42:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 175 transitions. [2024-11-09 04:42:01,217 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 175 transitions. Word has length 26 [2024-11-09 04:42:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:01,218 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 175 transitions. [2024-11-09 04:42:01,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-09 04:42:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 175 transitions. [2024-11-09 04:42:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 04:42:01,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:01,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:01,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:01,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash 598721405, now seen corresponding path program 1 times [2024-11-09 04:42:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964965181] [2024-11-09 04:42:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:01,421 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-09 04:42:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:01,422 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:01,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 04:42:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:01,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:42:01,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:01,622 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-09 04:42:01,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:01,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 04:42:01,865 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-09 04:42:01,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:01,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964965181] [2024-11-09 04:42:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964965181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:42:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727216261] [2024-11-09 04:42:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:01,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:42:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:42:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:42:01,868 INFO L87 Difference]: Start difference. First operand 149 states and 175 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-09 04:42:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:02,402 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2024-11-09 04:42:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:42:02,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 04:42:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:02,403 INFO L225 Difference]: With dead ends: 170 [2024-11-09 04:42:02,404 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 04:42:02,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:42:02,405 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:02,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:42:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 04:42:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 152. [2024-11-09 04:42:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.424) internal successors, (178), 151 states have internal predecessors, (178), 0 states have call successors, (0), 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-09 04:42:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 178 transitions. [2024-11-09 04:42:02,410 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 178 transitions. Word has length 27 [2024-11-09 04:42:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:02,410 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 178 transitions. [2024-11-09 04:42:02,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-09 04:42:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2024-11-09 04:42:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 04:42:02,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:02,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:02,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:02,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:02,613 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:02,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1221768158, now seen corresponding path program 2 times [2024-11-09 04:42:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635205768] [2024-11-09 04:42:02,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:02,614 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-09 04:42:02,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:02,615 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:02,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (27)] Waiting until timeout for monitored process [2024-11-09 04:42:02,816 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:02,816 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:02,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 04:42:02,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:02,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 04:42:02,840 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-09 04:42:02,858 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:02,858 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-09 04:42:02,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:42:02,897 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-09 04:42:03,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:03,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:42:03,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 30 treesize of output 13 [2024-11-09 04:42:03,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:03,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:42:03,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:42:03,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:42:03,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:42:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:03,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:03,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_614) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-11-09 04:42:03,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_614) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse3) (bvadd .cse0 (_ bv8 32) .cse3))))))) is different from false [2024-11-09 04:42:04,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_614) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse3) (bvadd .cse0 (_ bv12 32) .cse3))))))) is different from false [2024-11-09 04:42:04,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_612))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_611) .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_614) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_611) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse4) (bvadd .cse0 (_ bv12 32) .cse4)))))) is different from false [2024-11-09 04:42:04,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_611) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_612))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_611) .cse4 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_614) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2024-11-09 04:42:04,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_612))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_611) .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_614) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_611) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 04:42:04,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:04,583 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 89 treesize of output 80 [2024-11-09 04:42:04,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:04,599 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 69 treesize of output 60 [2024-11-09 04:42:04,608 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 102 treesize of output 84 [2024-11-09 04:42:04,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2024-11-09 04:42:04,634 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 40 [2024-11-09 04:42:04,644 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 12 [2024-11-09 04:42:04,653 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-09 04:42:04,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:04,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-09 04:42:04,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-09 04:42:04,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:04,716 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 92 treesize of output 56 [2024-11-09 04:42:04,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:04,726 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 24 treesize of output 12 [2024-11-09 04:42:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-09 04:42:04,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:04,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635205768] [2024-11-09 04:42:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635205768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:04,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1179946818] [2024-11-09 04:42:04,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:04,823 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:04,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 04:42:05,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:05,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:05,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 04:42:05,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:05,194 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-09 04:42:05,215 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:05,215 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-09 04:42:05,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:42:05,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:42:05,243 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-09 04:42:05,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:05,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:42:05,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:42:05,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:05,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:42:05,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:42:05,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:42:05,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:42:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:05,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:05,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_656) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-11-09 04:42:05,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_656) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-11-09 04:42:05,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_656) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-11-09 04:42:06,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_654))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_653) .cse1 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_656) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_653) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse4) (bvadd .cse0 (_ bv12 32) .cse4)))))) is different from false [2024-11-09 04:42:06,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_654))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_653) .cse2 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_656) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_653) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_654) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse5) (bvadd .cse0 (_ bv12 32) .cse5))))))) is different from false [2024-11-09 04:42:06,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_654))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_653) .cse1 v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_656) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_653) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_654) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_655) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 04:42:06,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:06,746 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 89 treesize of output 90 [2024-11-09 04:42:06,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:06,761 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 79 treesize of output 60 [2024-11-09 04:42:06,770 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 754 treesize of output 640 [2024-11-09 04:42:06,786 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 745 treesize of output 697 [2024-11-09 04:42:06,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2024-11-09 04:42:06,806 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 100 treesize of output 88 [2024-11-09 04:42:06,817 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 69 treesize of output 65 [2024-11-09 04:42:06,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 18 treesize of output 14 [2024-11-09 04:42:06,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:06,988 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 89 treesize of output 80 [2024-11-09 04:42:07,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:07,004 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 69 treesize of output 60 [2024-11-09 04:42:07,020 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 102 treesize of output 84 [2024-11-09 04:42:07,032 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 174 treesize of output 144 [2024-11-09 04:42:07,038 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 40 [2024-11-09 04:42:07,049 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-09 04:42:07,061 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 12 [2024-11-09 04:42:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-09 04:42:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1179946818] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:07,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402409526] [2024-11-09 04:42:07,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:07,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:42:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:42:07,108 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:42:07,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 04:42:07,346 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:07,346 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:07,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 04:42:07,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:07,356 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-09 04:42:07,370 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-09 04:42:07,392 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:07,392 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-09 04:42:07,408 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-09 04:42:07,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:42:07,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:07,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:42:07,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:42:07,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:42:07,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:42:07,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:42:07,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 31 treesize of output 13 [2024-11-09 04:42:07,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:42:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:07,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:08,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_697) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32) .cse2) (bvadd .cse0 (_ bv8 32) .cse2)))))) is different from false [2024-11-09 04:42:08,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_697) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-11-09 04:42:08,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_697) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2 (_ bv8 32)) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2024-11-09 04:42:08,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_695) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_696) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_696))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_695) .cse3 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_697) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) is different from false [2024-11-09 04:42:09,017 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_695) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_696) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_696))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_695) .cse4 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_697) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2024-11-09 04:42:09,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_696))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_695) .cse1 v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_697) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_695) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_696) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_698) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 04:42:09,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:09,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 1 case distinctions, treesize of input 89 treesize of output 80 [2024-11-09 04:42:09,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:09,195 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 69 treesize of output 60 [2024-11-09 04:42:09,204 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 102 treesize of output 84 [2024-11-09 04:42:09,211 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 174 treesize of output 144 [2024-11-09 04:42:09,222 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 40 [2024-11-09 04:42:09,234 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-09 04:42:09,249 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 12 [2024-11-09 04:42:09,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:09,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-09 04:42:09,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:09,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-09 04:42:09,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:09,333 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 92 treesize of output 56 [2024-11-09 04:42:09,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:42:09,342 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 24 treesize of output 12 [2024-11-09 04:42:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-09 04:42:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402409526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:09,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:42:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10, 12, 10, 12] total 32 [2024-11-09 04:42:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571368916] [2024-11-09 04:42:09,358 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:09,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 04:42:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:09,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 04:42:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=182, Unknown=18, NotChecked=774, Total=1056 [2024-11-09 04:42:09,362 INFO L87 Difference]: Start difference. First operand 152 states and 178 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 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-09 04:42:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:13,098 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2024-11-09 04:42:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:42:13,099 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 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) Word has length 27 [2024-11-09 04:42:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:13,100 INFO L225 Difference]: With dead ends: 158 [2024-11-09 04:42:13,100 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 04:42:13,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=148, Invalid=412, Unknown=18, NotChecked=1062, Total=1640 [2024-11-09 04:42:13,102 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1116 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:13,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1180 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 1116 Unchecked, 2.0s Time] [2024-11-09 04:42:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 04:42:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-09 04:42:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 157 states have internal predecessors, (184), 0 states have call successors, (0), 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-09 04:42:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2024-11-09 04:42:13,108 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 27 [2024-11-09 04:42:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2024-11-09 04:42:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 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-09 04:42:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2024-11-09 04:42:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 04:42:13,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:13,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:13,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:13,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:13,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (27)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:13,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:13,710 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1380494544, now seen corresponding path program 1 times [2024-11-09 04:42:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991952520] [2024-11-09 04:42:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:13,711 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-09 04:42:13,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:13,712 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:13,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 04:42:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:13,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 04:42:13,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:13,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:42:14,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:42:14,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:14,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:42:14,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:42:14,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2024-11-09 04:42:14,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-09 04:42:14,781 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-09 04:42:14,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:14,781 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:14,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991952520] [2024-11-09 04:42:14,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991952520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:14,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:14,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:42:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841239916] [2024-11-09 04:42:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:14,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:42:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:42:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:42:14,784 INFO L87 Difference]: Start difference. First operand 158 states and 184 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:16,465 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2024-11-09 04:42:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:42:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 04:42:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:16,466 INFO L225 Difference]: With dead ends: 190 [2024-11-09 04:42:16,467 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 04:42:16,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-09 04:42:16,468 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 180 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:16,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 331 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 04:42:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 04:42:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 159. [2024-11-09 04:42:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4090909090909092) internal successors, (186), 158 states have internal predecessors, (186), 0 states have call successors, (0), 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-09 04:42:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2024-11-09 04:42:16,474 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 28 [2024-11-09 04:42:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:16,474 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2024-11-09 04:42:16,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2024-11-09 04:42:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 04:42:16,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:16,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:16,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:16,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:16,676 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:16,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1380494545, now seen corresponding path program 1 times [2024-11-09 04:42:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:16,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119680271] [2024-11-09 04:42:16,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:16,677 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-09 04:42:16,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:16,679 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:16,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:16,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:42:16,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:17,034 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-09 04:42:17,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:17,035 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119680271] [2024-11-09 04:42:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119680271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:17,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:17,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:42:17,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867177294] [2024-11-09 04:42:17,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:42:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:17,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:42:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:42:17,037 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:17,269 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2024-11-09 04:42:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:42:17,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 04:42:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:17,271 INFO L225 Difference]: With dead ends: 154 [2024-11-09 04:42:17,271 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 04:42:17,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:42:17,272 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:17,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 56 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:42:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 04:42:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 04:42:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 153 states have internal predecessors, (178), 0 states have call successors, (0), 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-09 04:42:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2024-11-09 04:42:17,277 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 28 [2024-11-09 04:42:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:17,277 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2024-11-09 04:42:17,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2024-11-09 04:42:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 04:42:17,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:17,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:17,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:17,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:17,482 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1594359297, now seen corresponding path program 1 times [2024-11-09 04:42:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664529030] [2024-11-09 04:42:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:17,483 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-09 04:42:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:17,485 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:17,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (32)] Waiting until timeout for monitored process [2024-11-09 04:42:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:17,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:42:17,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:17,786 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-09 04:42:18,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:18,203 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 04:42:18,203 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 27 [2024-11-09 04:42:18,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 04:42:18,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 04:42:18,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:42:18,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 04:42:18,712 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-09 04:42:18,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:18,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664529030] [2024-11-09 04:42:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664529030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:42:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216778065] [2024-11-09 04:42:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:42:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:42:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:42:18,716 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:20,897 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2024-11-09 04:42:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:42:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 04:42:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:20,899 INFO L225 Difference]: With dead ends: 184 [2024-11-09 04:42:20,899 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 04:42:20,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:42:20,900 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 154 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:20,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 413 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 04:42:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 04:42:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 159. [2024-11-09 04:42:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 158 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 04:42:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2024-11-09 04:42:20,905 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 28 [2024-11-09 04:42:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:20,906 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2024-11-09 04:42:20,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2024-11-09 04:42:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 04:42:20,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:20,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:20,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (32)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:21,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:21,107 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:21,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1594359298, now seen corresponding path program 1 times [2024-11-09 04:42:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:21,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432655156] [2024-11-09 04:42:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:21,108 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-09 04:42:21,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:21,110 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:21,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (33)] Waiting until timeout for monitored process [2024-11-09 04:42:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:21,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 04:42:21,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:21,303 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-09 04:42:21,331 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:21,332 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-09 04:42:21,425 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-09 04:42:21,741 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-09 04:42:21,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:21,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 04:42:21,893 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 31 treesize of output 19 [2024-11-09 04:42:22,249 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 04:42:22,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 27 [2024-11-09 04:42:22,382 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-09 04:42:22,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:22,383 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:22,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432655156] [2024-11-09 04:42:22,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432655156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:22,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:22,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:42:22,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108569421] [2024-11-09 04:42:22,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:22,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:42:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:22,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:42:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:42:22,385 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:25,238 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2024-11-09 04:42:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:42:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 04:42:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:25,240 INFO L225 Difference]: With dead ends: 197 [2024-11-09 04:42:25,240 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 04:42:25,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:42:25,241 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:25,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 443 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 04:42:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 04:42:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2024-11-09 04:42:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 148 states have (on average 1.3513513513513513) internal successors, (200), 168 states have internal predecessors, (200), 0 states have call successors, (0), 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-09 04:42:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2024-11-09 04:42:25,250 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 28 [2024-11-09 04:42:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:25,251 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2024-11-09 04:42:25,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 04:42:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2024-11-09 04:42:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 04:42:25,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:25,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:25,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (33)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:25,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:25,452 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -485418085, now seen corresponding path program 1 times [2024-11-09 04:42:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601874829] [2024-11-09 04:42:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:25,453 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-09 04:42:25,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:25,455 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:25,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (34)] Waiting until timeout for monitored process [2024-11-09 04:42:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:25,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 04:42:25,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:25,692 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-09 04:42:25,724 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:42:25,724 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-09 04:42:26,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:26,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:26,205 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 31 treesize of output 19 [2024-11-09 04:42:26,324 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 23 treesize of output 15 [2024-11-09 04:42:26,412 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:42:26,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2024-11-09 04:42:26,522 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-09 04:42:26,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:26,522 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:26,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601874829] [2024-11-09 04:42:26,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601874829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:26,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:42:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429687704] [2024-11-09 04:42:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:26,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:42:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:42:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:42:26,524 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 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-09 04:42:28,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:42:29,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:42:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:32,665 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2024-11-09 04:42:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:42:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 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 31 [2024-11-09 04:42:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:32,667 INFO L225 Difference]: With dead ends: 193 [2024-11-09 04:42:32,667 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 04:42:32,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-11-09 04:42:32,668 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 162 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:32,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 310 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 04:42:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 04:42:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 169. [2024-11-09 04:42:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 148 states have (on average 1.337837837837838) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 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-09 04:42:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2024-11-09 04:42:32,674 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 31 [2024-11-09 04:42:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:32,674 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2024-11-09 04:42:32,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 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-09 04:42:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2024-11-09 04:42:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 04:42:32,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:32,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:32,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (34)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:32,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:32,876 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:32,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash -485429070, now seen corresponding path program 1 times [2024-11-09 04:42:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516091697] [2024-11-09 04:42:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:32,878 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-09 04:42:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:32,879 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:32,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (35)] Waiting until timeout for monitored process [2024-11-09 04:42:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:33,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 04:42:33,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:33,110 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-09 04:42:33,168 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:42:33,168 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-09 04:42:33,399 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-09 04:42:33,399 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-09 04:42:33,543 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-09 04:42:33,737 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-09 04:42:34,047 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 22 [2024-11-09 04:42:34,092 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 15 treesize of output 1 [2024-11-09 04:42:34,284 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 59 treesize of output 31 [2024-11-09 04:42:34,300 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 38 treesize of output 40 [2024-11-09 04:42:34,832 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 04:42:34,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2024-11-09 04:42:35,298 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-09 04:42:35,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:35,298 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:35,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516091697] [2024-11-09 04:42:35,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516091697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:35,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:35,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 04:42:35,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122593158] [2024-11-09 04:42:35,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:35,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:42:35,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:35,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:42:35,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:42:35,301 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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-09 04:42:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:39,006 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2024-11-09 04:42:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:42:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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 31 [2024-11-09 04:42:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:39,008 INFO L225 Difference]: With dead ends: 194 [2024-11-09 04:42:39,008 INFO L226 Difference]: Without dead ends: 194 [2024-11-09 04:42:39,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2024-11-09 04:42:39,010 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 158 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:39,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 529 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 04:42:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-09 04:42:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 169. [2024-11-09 04:42:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 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-09 04:42:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-11-09 04:42:39,016 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 31 [2024-11-09 04:42:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:39,016 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-11-09 04:42:39,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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-09 04:42:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-11-09 04:42:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:42:39,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:39,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:39,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (35)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:39,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:39,218 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:39,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2131568162, now seen corresponding path program 1 times [2024-11-09 04:42:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148773027] [2024-11-09 04:42:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:39,219 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-09 04:42:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:39,221 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:39,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (36)] Waiting until timeout for monitored process [2024-11-09 04:42:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:39,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 04:42:39,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:39,478 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-09 04:42:39,558 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 04:42:39,559 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-09 04:42:39,786 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-09 04:42:39,786 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-09 04:42:39,973 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-09 04:42:40,171 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-09 04:42:40,455 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 27 treesize of output 15 [2024-11-09 04:42:40,485 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-09 04:42:40,712 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 04:42:40,713 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 2 case distinctions, treesize of input 59 treesize of output 37 [2024-11-09 04:42:40,745 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 22 [2024-11-09 04:42:41,861 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-11-09 04:42:41,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2024-11-09 04:42:42,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 04:42:42,275 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-09 04:42:42,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:42:42,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148773027] [2024-11-09 04:42:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148773027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:42:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:42:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 04:42:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217300432] [2024-11-09 04:42:42,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:42:42,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:42:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:42:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:42:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:42:42,277 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 04:42:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:42:47,185 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2024-11-09 04:42:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 04:42:47,186 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-09 04:42:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:42:47,187 INFO L225 Difference]: With dead ends: 186 [2024-11-09 04:42:47,187 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 04:42:47,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2024-11-09 04:42:47,188 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 119 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:42:47,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 605 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 04:42:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 04:42:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 164. [2024-11-09 04:42:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 163 states have internal predecessors, (189), 0 states have call successors, (0), 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-09 04:42:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2024-11-09 04:42:47,194 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 32 [2024-11-09 04:42:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:42:47,194 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2024-11-09 04:42:47,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 04:42:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2024-11-09 04:42:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 04:42:47,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:42:47,195 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:42:47,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (36)] Forceful destruction successful, exit code 0 [2024-11-09 04:42:47,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:47,396 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:42:47,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:42:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash -980390840, now seen corresponding path program 1 times [2024-11-09 04:42:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:42:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409968568] [2024-11-09 04:42:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:42:47,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-09 04:42:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:42:47,401 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:42:47,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (37)] Waiting until timeout for monitored process [2024-11-09 04:42:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:42:47,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 04:42:47,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:42:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:42:48,290 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 38 treesize of output 22 [2024-11-09 04:42:50,616 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_22| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22|)))) (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_22| (_ BitVec 32))) (and (exists ((v_DerPreprocessor_4 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem22#1.base_10| (_ BitVec 32))) (and (= (bvadd v_DerPreprocessor_4 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22| v_DerPreprocessor_4) |v_ULTIMATE.start_main_#t~mem22#1.base_10| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_22|)) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_10|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_10| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_22| (_ bv0 1))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22|))))) is different from true [2024-11-09 04:42:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:42:50,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:50,972 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 32 treesize of output 28 [2024-11-09 04:42:51,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2024-11-09 04:43:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:01,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:43:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409968568] [2024-11-09 04:43:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409968568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:43:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1182500120] [2024-11-09 04:43:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:43:01,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:43:01,190 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:43:01,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-09 04:43:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:01,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 04:43:01,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:02,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:43:03,208 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 45 treesize of output 25 [2024-11-09 04:43:03,801 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem22#1.base_13| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#list~0#1.base_24| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_24|)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_13| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_24| (_ bv0 1)) |c_#valid|) (bvult |v_ULTIMATE.start_main_#t~mem22#1.base_13| |#StackHeapBarrier|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_13|)) (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#list~0#1.base_24|)))) is different from true [2024-11-09 04:43:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:03,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:43:04,093 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 32 treesize of output 28 [2024-11-09 04:43:04,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2024-11-09 04:43:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1182500120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:43:05,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512703277] [2024-11-09 04:43:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:05,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:43:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:43:05,404 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:43:05,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-09 04:43:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:05,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 04:43:05,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:05,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:43:06,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 38 treesize of output 22 [2024-11-09 04:43:08,386 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_26| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_26| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_26|)))) is different from true [2024-11-09 04:43:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:08,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:43:08,701 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 32 treesize of output 28 [2024-11-09 04:43:08,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2024-11-09 04:43:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512703277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:43:18,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:43:18,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7, 7] total 20 [2024-11-09 04:43:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289442385] [2024-11-09 04:43:18,055 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:43:18,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 04:43:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:43:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 04:43:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=247, Unknown=7, NotChecked=102, Total=420 [2024-11-09 04:43:18,057 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand has 21 states, 20 states have (on average 4.45) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 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-09 04:43:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:43:21,816 INFO L93 Difference]: Finished difference Result 232 states and 261 transitions. [2024-11-09 04:43:21,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:43:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.45) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 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-09 04:43:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:43:21,818 INFO L225 Difference]: With dead ends: 232 [2024-11-09 04:43:21,818 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 04:43:21,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 162 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=108, Invalid=449, Unknown=7, NotChecked=138, Total=702 [2024-11-09 04:43:21,820 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 173 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:43:21,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 548 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 490 Invalid, 1 Unknown, 459 Unchecked, 2.8s Time] [2024-11-09 04:43:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 04:43:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 193. [2024-11-09 04:43:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 172 states have (on average 1.2790697674418605) internal successors, (220), 192 states have internal predecessors, (220), 0 states have call successors, (0), 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-09 04:43:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2024-11-09 04:43:21,827 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 33 [2024-11-09 04:43:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:43:21,827 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2024-11-09 04:43:21,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.45) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 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-09 04:43:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2024-11-09 04:43:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 04:43:21,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:43:21,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:43:21,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-11-09 04:43:22,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (37)] Forceful destruction successful, exit code 0 [2024-11-09 04:43:22,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-09 04:43:22,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:43:22,430 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:43:22,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:43:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash -980390868, now seen corresponding path program 1 times [2024-11-09 04:43:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:43:22,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370927914] [2024-11-09 04:43:22,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:22,431 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-09 04:43:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:43:22,432 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:43:22,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (40)] Waiting until timeout for monitored process [2024-11-09 04:43:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:22,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 04:43:22,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:22,933 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:43:22,961 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:43:23,252 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:43:23,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 04:43:23,320 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:43:23,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 04:43:23,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:23,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2024-11-09 04:43:23,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:23,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2024-11-09 04:43:24,806 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2024-11-09 04:43:24,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 46 [2024-11-09 04:43:24,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 04:43:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:25,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:43:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:46,480 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:43:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370927914] [2024-11-09 04:43:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370927914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:43:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [521630292] [2024-11-09 04:43:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:43:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:43:46,482 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:43:46,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-09 04:43:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:46,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 04:43:46,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:47,861 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:43:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:43:48,493 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:43:48,493 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 2 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 04:43:48,593 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:43:48,593 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 2 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 04:43:49,211 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-11-09 04:43:49,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 40 [2024-11-09 04:43:49,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:49,294 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 18 [2024-11-09 04:43:53,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:43:53,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2024-11-09 04:43:53,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:43:53,300 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 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 04:43:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:54,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:43:55,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (or (forall ((v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))) (= (_ bv0 32) (select (select .cse0 .cse1) (_ bv4 32)))) (forall ((v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select .cse2 .cse1) (_ bv4 32))))))))) is different from false [2024-11-09 04:43:56,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) (and (forall ((v_ArrVal_1157 (_ BitVec 32)) (|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161))) (or (not (= (_ bv0 32) (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1157)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv4 32)))))) (or (forall ((v_ArrVal_1157 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1157)))) (store .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv4 32)))) (forall ((|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))))))) is different from false [2024-11-09 04:43:56,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd |c_ULTIMATE.start_append_~node~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse6 |c_ULTIMATE.start_append_#t~mem14#1.base|)) (.cse3 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse6 |c_ULTIMATE.start_append_#t~mem14#1.offset|))) (and (forall ((v_ArrVal_1157 (_ BitVec 32)) (|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161))) (or (not (= (_ bv0 32) (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1157)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv4 32)))))) (or (forall ((v_ArrVal_1157 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1157)))) (store .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv4 32)))) (forall ((|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)))))))) is different from false [2024-11-09 04:43:56,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd |c_ULTIMATE.start_append_~node~0#1.offset| (_ bv4 32)))) (let ((.cse3 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|)))) (and (forall ((v_ArrVal_1157 (_ BitVec 32)) (|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161))) (or (not (= (_ bv0 32) (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1157)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv4 32)))))) (or (forall ((|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1161 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1161) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)))) (forall ((v_ArrVal_1157 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1157)))) (store .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv4 32)))))))) is different from false [2024-11-09 04:43:56,764 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-09 04:43:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:43:58,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [521630292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:43:58,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934726514] [2024-11-09 04:43:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:43:58,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:43:58,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:43:58,810 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:43:58,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-09 04:43:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:43:59,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 04:43:59,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:43:59,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:43:59,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-09 04:44:00,200 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:44:00,200 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 2 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 04:44:00,275 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 04:44:00,276 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 2 case distinctions, treesize of input 30 treesize of output 25 [2024-11-09 04:44:00,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:00,826 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 42 treesize of output 26 [2024-11-09 04:44:00,923 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-11-09 04:44:00,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2024-11-09 04:44:04,738 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 10 treesize of output 9 [2024-11-09 04:44:05,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:44:05,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 52 [2024-11-09 04:44:05,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:44:05,319 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 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 04:44:05,349 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:44:05,350 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-09 04:44:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:05,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:44:06,324 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 10 [2024-11-09 04:44:29,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_append_~node~0#1.offset| (_ bv4 32))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (and (forall ((|ULTIMATE.start_append_~node~0#1.base| (_ BitVec 32))) (or (forall ((v_ArrVal_1198 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse4) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1198)))) (store .cse2 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse2 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (select .cse0 .cse1) (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse1))))) (forall ((|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse5) |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1201) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)))))) (forall ((v_ArrVal_1198 (_ BitVec 32)) (|ULTIMATE.start_append_~node~0#1.base| (_ BitVec 32))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse4) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1198)))) (store .cse8 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse8 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (forall ((|ULTIMATE.start_append_#t~ret15#1.offset| (_ BitVec 32)) (v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse5) |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1201))) (or (not (= (_ bv0 32) (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select .cse6 .cse7) (_ bv4 32)))))) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse7)))))) is different from false [2024-11-09 04:44:29,506 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-09 04:44:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:44:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934726514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:44:33,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:44:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15, 15, 16, 16] total 77 [2024-11-09 04:44:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291173795] [2024-11-09 04:44:33,441 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:44:33,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-11-09 04:44:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:44:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-11-09 04:44:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=4594, Unknown=55, NotChecked=720, Total=5852 [2024-11-09 04:44:33,444 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand has 77 states, 77 states have (on average 2.207792207792208) internal successors, (170), 77 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 04:44:35,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:37,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:39,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:44:55,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:45:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:23,249 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2024-11-09 04:45:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 04:45:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.207792207792208) internal successors, (170), 77 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 04:45:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:23,251 INFO L225 Difference]: With dead ends: 201 [2024-11-09 04:45:23,251 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 04:45:23,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2782 ImplicationChecksByTransitivity, 83.8s TimeCoverageRelationStatistics Valid=811, Invalid=6805, Unknown=60, NotChecked=880, Total=8556 [2024-11-09 04:45:23,254 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:23,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1944 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1083 Invalid, 4 Unknown, 312 Unchecked, 27.3s Time] [2024-11-09 04:45:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 04:45:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 175. [2024-11-09 04:45:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 174 states have internal predecessors, (201), 0 states have call successors, (0), 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-09 04:45:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2024-11-09 04:45:23,259 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 33 [2024-11-09 04:45:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2024-11-09 04:45:23,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.207792207792208) internal successors, (170), 77 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 04:45:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2024-11-09 04:45:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 04:45:23,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:23,261 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:45:23,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-11-09 04:45:23,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (40)] Forceful destruction successful, exit code 0 [2024-11-09 04:45:23,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2024-11-09 04:45:23,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 04:45:23,868 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 04:45:23,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1645244589, now seen corresponding path program 3 times [2024-11-09 04:45:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:45:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89040445] [2024-11-09 04:45:23,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:45:23,869 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-09 04:45:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:45:23,871 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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-09 04:45:23,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/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 (43)] Waiting until timeout for monitored process [2024-11-09 04:45:24,217 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 04:45:24,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:45:24,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 04:45:24,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:24,230 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-09 04:45:24,256 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-09 04:45:24,281 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:45:24,282 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-09 04:45:24,320 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-09 04:45:24,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:45:24,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:45:24,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:45:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:45:25,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:45:25,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:45:25,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:45:25,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:45:25,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:45:25,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:45:25,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:45:25,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:45:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:45:25,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:26,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1254) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_data_#t~mem7#1.offset| .cse0 (_ bv4 32)) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))))) is different from false [2024-11-09 04:45:26,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (and (forall ((v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1254) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))) (not (bvule (bvadd .cse0 (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| .cse2))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32)))))) is different from false [2024-11-09 04:45:26,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (not (bvule (bvadd .cse0 (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| .cse2))) (and (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1254) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse0 .cse3 (_ bv8 32)) (bvadd .cse0 .cse3 (_ bv12 32)))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32)))))) is different from false [2024-11-09 04:45:35,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1249 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1249))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (or (not (bvule (bvadd (_ bv4 32) .cse0) .cse1)) (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1250))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse1 (select |c_#length| .cse2))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1252 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store .cse8 .cse2 v_ArrVal_1251))) (let ((.cse3 (store .cse7 .cse2 v_ArrVal_1252)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule (bvadd (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| .cse5))) (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store .cse3 .cse5 v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1254) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))))))) (forall ((v_ArrVal_1249 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1249))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse10 (bvadd (_ bv8 32) .cse17))) (or (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1250))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse10 (select |c_#length| .cse11))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1252 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store .cse16 .cse11 v_ArrVal_1252)) (.cse14 (select (select (store .cse15 .cse11 v_ArrVal_1251) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse13 .cse14 v_ArrVal_1253) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv12 32) .cse12) (bvadd (_ bv16 32) .cse12)))) (not (bvule (bvadd (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| .cse14)))))))))) (not (bvule (bvadd (_ bv4 32) .cse17) .cse10)))))))))) is different from false [2024-11-09 04:45:35,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:35,276 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 360 treesize of output 320 [2024-11-09 04:45:35,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:35,324 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 284 treesize of output 184 [2024-11-09 04:45:35,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9692 treesize of output 8204 [2024-11-09 04:45:35,458 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 6553 treesize of output 6331 [2024-11-09 04:45:35,516 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 233 treesize of output 201 [2024-11-09 04:45:35,540 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 136 treesize of output 128 [2024-11-09 04:45:35,562 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 128 treesize of output 116 [2024-11-09 04:45:35,579 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 215 treesize of output 175 [2024-11-09 04:45:35,605 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 145 treesize of output 137 [2024-11-09 04:45:35,615 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 201 treesize of output 181 [2024-11-09 04:45:36,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:36,771 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 360 treesize of output 310 [2024-11-09 04:45:36,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:36,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 1 case distinctions, treesize of input 274 treesize of output 184 [2024-11-09 04:45:36,843 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 1040 treesize of output 884 [2024-11-09 04:45:36,873 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 2826 treesize of output 2634 [2024-11-09 04:45:36,928 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 154 treesize of output 142 [2024-11-09 04:45:36,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 142 treesize of output 130 [2024-11-09 04:45:36,983 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 164 treesize of output 140 [2024-11-09 04:45:36,997 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 174 treesize of output 150 [2024-11-09 04:45:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-11-09 04:45:40,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:40,477 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 508 treesize of output 641 [2024-11-09 04:45:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-09 04:45:41,115 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:45:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89040445] [2024-11-09 04:45:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89040445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:45:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2137022175] [2024-11-09 04:45:41,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:45:41,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:45:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:45:41,117 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:45:41,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2988788c-a07c-413e-a7ee-6ae694c3c0a8/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2024-11-09 04:45:41,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 04:45:41,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:45:41,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:45:41,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:41,632 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-09 04:45:41,663 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 04:45:41,664 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-09 04:45:41,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 04:45:41,712 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-09 04:45:41,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 04:45:41,948 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:45:41,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:45:41,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:45:42,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:45:42,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:45:42,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:45:42,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 04:45:42,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 04:45:42,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 04:45:42,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 04:45:42,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 04:45:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:45:42,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:45:49,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1301))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse2 (bvadd .cse0 (_ bv8 32) .cse1))) (or (not (bvule (bvadd .cse0 (_ bv4 32) .cse1) .cse2)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1302))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse4 .cse3 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) .cse0 (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_1304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))))) (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1301))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse9 (bvadd .cse0 (_ bv8 32) .cse8))) (or (not (bvule (bvadd .cse0 (_ bv4 32) .cse8) .cse9)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1302) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse9 (select |c_#length| .cse10))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store .cse12 .cse10 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse11 .cse0 (_ bv8 32)) (bvadd .cse11 .cse0 (_ bv12 32)))))))))))))))) is different from false [2024-11-09 04:45:49,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1301))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse2 (bvadd .cse0 (_ bv12 32) .cse1))) (or (not (bvule (bvadd .cse0 (_ bv8 32) .cse1) .cse2)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1302) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse4 .cse5 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse3 .cse0 (_ bv12 32)) (bvadd .cse3 .cse0 (_ bv16 32))))) (not (bvule .cse2 (select |c_#length| .cse5))))))))))) (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1301))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (bvadd .cse0 (_ bv12 32) .cse8))) (or (not (bvule (bvadd .cse0 (_ bv8 32) .cse8) .cse9)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1302))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse10 .cse11 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) .cse0 (_ bv16 32)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_1304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (not (bvule .cse9 (select |c_#length| .cse11))))))))))))))) is different from false [2024-11-09 04:45:50,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1299))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1300) .cse7 v_ArrVal_1301))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse0 (bvadd .cse2 (_ bv12 32) .cse8))) (or (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store .cse6 .cse7 v_ArrVal_1302) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse4 .cse1 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse2 (_ bv12 32) .cse3) (bvadd .cse2 (_ bv16 32) .cse3))))))) (not (bvule (bvadd .cse2 (_ bv8 32) .cse8) .cse0))))))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1299))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1300) .cse15 v_ArrVal_1301))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse10 (bvadd .cse2 (_ bv12 32) .cse9))) (or (not (bvule (bvadd .cse2 (_ bv8 32) .cse9) .cse10)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_1302))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse2 (_ bv16 32) (select (select (store .cse11 .cse12 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))) (not (bvule .cse10 (select |c_#length| .cse12)))))))))))))))) is different from false [2024-11-09 04:45:50,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1299))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1300) .cse8 v_ArrVal_1301))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse2 (bvadd .cse0 (_ bv12 32) .cse1))) (or (not (bvule (bvadd .cse0 (_ bv8 32) .cse1) .cse2)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse7 .cse8 v_ArrVal_1302) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store .cse5 .cse3 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse4 (_ bv12 32)) (bvadd .cse0 .cse4 (_ bv16 32))))))))))))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1299))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1300) .cse16 v_ArrVal_1301))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (bvadd .cse0 (_ bv12 32) .cse10))) (or (not (bvule (bvadd .cse0 (_ bv8 32) .cse10) .cse11)) (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_1302))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse11 (select |c_#length| .cse12))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store .cse13 .cse12 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv16 32)) (select |c_#length| (select (select (store .cse14 .cse12 v_ArrVal_1304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))))))))) is different from false [2024-11-09 04:45:50,875 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1299))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1300) .cse6 v_ArrVal_1301))) (let ((.cse7 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse0 (bvadd (_ bv12 32) .cse7))) (or (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_1302))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse2 .cse1 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv16 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (not (bvule (bvadd (_ bv8 32) .cse7) .cse0))))))))) (forall ((v_ArrVal_1299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1299))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1300) .cse14 v_ArrVal_1301))) (let ((.cse15 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse9 (bvadd (_ bv12 32) .cse15))) (or (forall ((v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse13 .cse14 v_ArrVal_1302) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (not (bvule .cse9 (select |c_#length| .cse10))) (forall ((v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store .cse12 .cse10 v_ArrVal_1303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse11 (_ bv12 32)) (bvadd .cse11 (_ bv16 32)))))))) (not (bvule (bvadd (_ bv8 32) .cse15) .cse9)))))))))))) is different from false [2024-11-09 04:45:50,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,923 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 358 treesize of output 328 [2024-11-09 04:45:50,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:50,950 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 318 treesize of output 208 [2024-11-09 04:45:50,967 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 65460 treesize of output 56466 [2024-11-09 04:45:51,531 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 11403 treesize of output 11007 [2024-11-09 04:45:51,603 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 831 treesize of output 787 [2024-11-09 04:45:51,616 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 965 treesize of output 913 [2024-11-09 04:45:51,632 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 913 treesize of output 765 [2024-11-09 04:45:51,670 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 635 treesize of output 599 [2024-11-09 04:45:51,699 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 677 treesize of output 569 [2024-11-09 04:45:51,719 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 590 treesize of output 562 [2024-11-09 04:45:52,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:52,800 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 358 treesize of output 318 [2024-11-09 04:45:52,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:45:52,834 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 308 treesize of output 208 [2024-11-09 04:45:52,855 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 1080 treesize of output 918 [2024-11-09 04:45:52,886 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 1160 treesize of output 1064 [2024-11-09 04:45:52,924 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 154 treesize of output 142 [2024-11-09 04:45:52,939 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 210 treesize of output 190 [2024-11-09 04:45:52,952 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 190 treesize of output 162 [2024-11-09 04:45:52,965 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 162 treesize of output 142 [2024-11-09 04:45:53,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 53 treesize of output 45