./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:23:44,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:23:44,931 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 18:23:44,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:23:44,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:23:44,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:23:44,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:23:44,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:23:44,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:23:44,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:23:44,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:23:44,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:23:44,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:23:44,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:23:44,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:23:44,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:23:44,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:23:44,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:23:44,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:23:44,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:23:44,966 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:23:44,973 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:23:44,974 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:23:44,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:23:44,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:23:44,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:23:44,975 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:23:44,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:23:44,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:23:44,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:23:44,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:23:44,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:23:44,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:23:44,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:23:44,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:23:44,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:23:44,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:23:44,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:23:44,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:23:44,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:23:44,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:23:44,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:23:44,991 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-08 18:23:45,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:23:45,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:23:45,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:23:45,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:23:45,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:23:45,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i Unable to find full path for "g++" [2024-11-08 18:23:47,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:23:47,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:23:47,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-08 18:23:47,613 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data/14338ed77/3a111cee43704e779166d7454f0a8380/FLAGc9ba75417 [2024-11-08 18:23:47,633 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data/14338ed77/3a111cee43704e779166d7454f0a8380 [2024-11-08 18:23:47,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:23:47,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:23:47,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:23:47,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:23:47,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:23:47,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:23:47" (1/1) ... [2024-11-08 18:23:47,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1ff898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:47, skipping insertion in model container [2024-11-08 18:23:47,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:23:47" (1/1) ... [2024-11-08 18:23:47,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:23:48,139 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-08 18:23:48,193 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-08 18:23:48,201 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-08 18:23:48,206 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-08 18:23:48,222 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-08 18:23:48,251 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-08 18:23:48,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:23:48,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:23:48,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:23:48,416 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:23:48,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48 WrapperNode [2024-11-08 18:23:48,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:23:48,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:23:48,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:23:48,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:23:48,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,508 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-08 18:23:48,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:23:48,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:23:48,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:23:48,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:23:48,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,606 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-08 18:23:48,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:23:48,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:23:48,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:23:48,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:23:48,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (1/1) ... [2024-11-08 18:23:48,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:23:48,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:23:48,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:23:48,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:23:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:23:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:23:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:23:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:23:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 18:23:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 18:23:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 18:23:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 18:23:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:23:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:23:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:23:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:23:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:23:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:23:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:23:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:23:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:23:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:23:48,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:23:49,055 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:23:49,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:23:49,063 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:23:49,105 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:23:51,034 INFO L? ?]: Removed 767 outVars from TransFormulas that were not future-live. [2024-11-08 18:23:51,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:23:51,062 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:23:51,063 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-08 18:23:51,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:23:51 BoogieIcfgContainer [2024-11-08 18:23:51,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:23:51,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:23:51,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:23:51,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:23:51,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:23:47" (1/3) ... [2024-11-08 18:23:51,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c95d23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:23:51, skipping insertion in model container [2024-11-08 18:23:51,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:23:48" (2/3) ... [2024-11-08 18:23:51,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c95d23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:23:51, skipping insertion in model container [2024-11-08 18:23:51,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:23:51" (3/3) ... [2024-11-08 18:23:51,074 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2024-11-08 18:23:51,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:23:51,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-08 18:23:51,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:23:51,163 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=PETRI_NET, 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;@5571d937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:23:51,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-08 18:23:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 741 states, 419 states have (on average 2.052505966587112) internal successors, (860), 736 states have internal predecessors, (860), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:23:51,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:51,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:23:51,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042701, now seen corresponding path program 1 times [2024-11-08 18:23:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832019037] [2024-11-08 18:23:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:51,362 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-08 18:23:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832019037] [2024-11-08 18:23:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832019037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:23:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466177321] [2024-11-08 18:23:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:23:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:23:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:23:51,408 INFO L87 Difference]: Start difference. First operand has 741 states, 419 states have (on average 2.052505966587112) internal successors, (860), 736 states have internal predecessors, (860), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:51,493 INFO L93 Difference]: Finished difference Result 731 states and 823 transitions. [2024-11-08 18:23:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:23:51,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-08 18:23:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:51,525 INFO L225 Difference]: With dead ends: 731 [2024-11-08 18:23:51,525 INFO L226 Difference]: Without dead ends: 729 [2024-11-08 18:23:51,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:23:51,530 INFO L432 NwaCegarLoop]: 823 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, 823 SdHoareTripleChecker+Invalid, 0 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-08 18:23:51,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:23:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-08 18:23:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-11-08 18:23:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 413 states have (on average 1.973365617433414) internal successors, (815), 724 states have internal predecessors, (815), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 821 transitions. [2024-11-08 18:23:51,631 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 821 transitions. Word has length 6 [2024-11-08 18:23:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 821 transitions. [2024-11-08 18:23:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 821 transitions. [2024-11-08 18:23:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:23:51,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:51,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:23:51,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:23:51,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:51,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042763, now seen corresponding path program 1 times [2024-11-08 18:23:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801868833] [2024-11-08 18:23:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:51,747 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-08 18:23:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801868833] [2024-11-08 18:23:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801868833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:51,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:51,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:23:51,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875790332] [2024-11-08 18:23:51,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:51,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:23:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:23:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:51,754 INFO L87 Difference]: Start difference. First operand 729 states and 821 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:52,498 INFO L93 Difference]: Finished difference Result 683 states and 777 transitions. [2024-11-08 18:23:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:23:52,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-08 18:23:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:52,501 INFO L225 Difference]: With dead ends: 683 [2024-11-08 18:23:52,501 INFO L226 Difference]: Without dead ends: 683 [2024-11-08 18:23:52,501 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-08 18:23:52,503 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 684 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:52,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 478 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:23:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-08 18:23:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2024-11-08 18:23:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 413 states have (on average 1.854721549636804) internal successors, (766), 675 states have internal predecessors, (766), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 772 transitions. [2024-11-08 18:23:52,535 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 772 transitions. Word has length 6 [2024-11-08 18:23:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:52,536 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 772 transitions. [2024-11-08 18:23:52,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 772 transitions. [2024-11-08 18:23:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:23:52,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:52,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:23:52,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:23:52,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:52,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042764, now seen corresponding path program 1 times [2024-11-08 18:23:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171063674] [2024-11-08 18:23:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:52,715 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-08 18:23:52,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:52,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171063674] [2024-11-08 18:23:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171063674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:52,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:23:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664097629] [2024-11-08 18:23:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:52,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:23:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:23:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:52,719 INFO L87 Difference]: Start difference. First operand 680 states and 772 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:53,365 INFO L93 Difference]: Finished difference Result 758 states and 857 transitions. [2024-11-08 18:23:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:23:53,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-08 18:23:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:53,369 INFO L225 Difference]: With dead ends: 758 [2024-11-08 18:23:53,369 INFO L226 Difference]: Without dead ends: 758 [2024-11-08 18:23:53,370 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-08 18:23:53,371 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 420 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:53,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 842 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:23:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-08 18:23:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 709. [2024-11-08 18:23:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 453 states have (on average 1.8410596026490067) internal successors, (834), 704 states have internal predecessors, (834), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 840 transitions. [2024-11-08 18:23:53,387 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 840 transitions. Word has length 6 [2024-11-08 18:23:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:53,387 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 840 transitions. [2024-11-08 18:23:53,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 840 transitions. [2024-11-08 18:23:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 18:23:53,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:53,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:53,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:23:53,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:53,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1975206730, now seen corresponding path program 1 times [2024-11-08 18:23:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976106767] [2024-11-08 18:23:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:53,447 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-08 18:23:53,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:53,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976106767] [2024-11-08 18:23:53,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976106767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:53,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:53,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:23:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942075566] [2024-11-08 18:23:53,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:53,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:23:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:23:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:53,452 INFO L87 Difference]: Start difference. First operand 709 states and 840 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:53,527 INFO L93 Difference]: Finished difference Result 1393 states and 1652 transitions. [2024-11-08 18:23:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:23:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 18:23:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:53,533 INFO L225 Difference]: With dead ends: 1393 [2024-11-08 18:23:53,534 INFO L226 Difference]: Without dead ends: 1393 [2024-11-08 18:23:53,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:53,535 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 726 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:53,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1511 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:23:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-08 18:23:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 711. [2024-11-08 18:23:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 455 states have (on average 1.8373626373626373) internal successors, (836), 706 states have internal predecessors, (836), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 842 transitions. [2024-11-08 18:23:53,571 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 842 transitions. Word has length 7 [2024-11-08 18:23:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:53,572 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 842 transitions. [2024-11-08 18:23:53,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 842 transitions. [2024-11-08 18:23:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:23:53,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:53,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:23:53,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082515, now seen corresponding path program 1 times [2024-11-08 18:23:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615928739] [2024-11-08 18:23:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:53,769 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-08 18:23:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615928739] [2024-11-08 18:23:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615928739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:23:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524387136] [2024-11-08 18:23:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:53,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:23:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:23:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:23:53,773 INFO L87 Difference]: Start difference. First operand 711 states and 842 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 18:23:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:54,654 INFO L93 Difference]: Finished difference Result 737 states and 895 transitions. [2024-11-08 18:23:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:23:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 18:23:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:54,658 INFO L225 Difference]: With dead ends: 737 [2024-11-08 18:23:54,658 INFO L226 Difference]: Without dead ends: 737 [2024-11-08 18:23:54,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:54,661 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 949 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:54,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 747 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:23:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-08 18:23:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 688. [2024-11-08 18:23:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 455 states have (on average 1.786813186813187) internal successors, (813), 683 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 819 transitions. [2024-11-08 18:23:54,684 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 819 transitions. Word has length 17 [2024-11-08 18:23:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:54,684 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 819 transitions. [2024-11-08 18:23:54,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 18:23:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 819 transitions. [2024-11-08 18:23:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:23:54,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:54,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:54,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:23:54,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:54,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082514, now seen corresponding path program 1 times [2024-11-08 18:23:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:54,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947264083] [2024-11-08 18:23:54,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:54,841 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-08 18:23:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947264083] [2024-11-08 18:23:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947264083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:54,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:23:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83875397] [2024-11-08 18:23:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:54,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:23:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:23:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:54,846 INFO L87 Difference]: Start difference. First operand 688 states and 819 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-08 18:23:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:54,888 INFO L93 Difference]: Finished difference Result 612 states and 714 transitions. [2024-11-08 18:23:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:23:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-08 18:23:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:54,892 INFO L225 Difference]: With dead ends: 612 [2024-11-08 18:23:54,892 INFO L226 Difference]: Without dead ends: 612 [2024-11-08 18:23:54,892 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-08 18:23:54,895 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 61 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:54,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1189 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:23:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-08 18:23:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2024-11-08 18:23:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 391 states have (on average 1.8107416879795397) internal successors, (708), 607 states have internal predecessors, (708), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 714 transitions. [2024-11-08 18:23:54,914 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 714 transitions. Word has length 17 [2024-11-08 18:23:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:54,914 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 714 transitions. [2024-11-08 18:23:54,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 714 transitions. [2024-11-08 18:23:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 18:23:54,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:54,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:54,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:23:54,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278920, now seen corresponding path program 1 times [2024-11-08 18:23:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519395086] [2024-11-08 18:23:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:54,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:55,054 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-08 18:23:55,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:55,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519395086] [2024-11-08 18:23:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519395086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:55,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:55,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:23:55,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536012486] [2024-11-08 18:23:55,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:55,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:23:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:23:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:23:55,057 INFO L87 Difference]: Start difference. First operand 612 states and 714 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:55,143 INFO L93 Difference]: Finished difference Result 594 states and 689 transitions. [2024-11-08 18:23:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:23:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 18:23:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:55,148 INFO L225 Difference]: With dead ends: 594 [2024-11-08 18:23:55,148 INFO L226 Difference]: Without dead ends: 594 [2024-11-08 18:23:55,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:55,152 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 41 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:55,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1730 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:23:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-08 18:23:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2024-11-08 18:23:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 586 states have internal predecessors, (680), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 686 transitions. [2024-11-08 18:23:55,168 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 686 transitions. Word has length 18 [2024-11-08 18:23:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:55,168 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 686 transitions. [2024-11-08 18:23:55,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 686 transitions. [2024-11-08 18:23:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 18:23:55,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:55,169 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-08 18:23:55,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:23:55,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash 899773094, now seen corresponding path program 1 times [2024-11-08 18:23:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612782353] [2024-11-08 18:23:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:55,380 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-08 18:23:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612782353] [2024-11-08 18:23:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612782353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:23:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445879014] [2024-11-08 18:23:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:23:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:23:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:23:55,384 INFO L87 Difference]: Start difference. First operand 591 states and 686 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-08 18:23:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:56,218 INFO L93 Difference]: Finished difference Result 685 states and 775 transitions. [2024-11-08 18:23:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:23:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-08 18:23:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:56,222 INFO L225 Difference]: With dead ends: 685 [2024-11-08 18:23:56,222 INFO L226 Difference]: Without dead ends: 685 [2024-11-08 18:23:56,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:56,223 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 419 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:56,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1029 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:23:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-08 18:23:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 587. [2024-11-08 18:23:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 377 states have (on average 1.793103448275862) internal successors, (676), 582 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 682 transitions. [2024-11-08 18:23:56,240 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 682 transitions. Word has length 32 [2024-11-08 18:23:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 682 transitions. [2024-11-08 18:23:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-08 18:23:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 682 transitions. [2024-11-08 18:23:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 18:23:56,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:56,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:56,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:23:56,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:56,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1786048504, now seen corresponding path program 1 times [2024-11-08 18:23:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:56,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360928277] [2024-11-08 18:23:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:56,441 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-08 18:23:56,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360928277] [2024-11-08 18:23:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360928277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:56,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:56,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:23:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122486432] [2024-11-08 18:23:56,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:56,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:23:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:56,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:23:56,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:23:56,450 INFO L87 Difference]: Start difference. First operand 587 states and 682 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:56,537 INFO L93 Difference]: Finished difference Result 587 states and 678 transitions. [2024-11-08 18:23:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:23:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-08 18:23:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:56,540 INFO L225 Difference]: With dead ends: 587 [2024-11-08 18:23:56,541 INFO L226 Difference]: Without dead ends: 587 [2024-11-08 18:23:56,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:56,542 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 21 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:56,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1712 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:23:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-08 18:23:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2024-11-08 18:23:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 377 states have (on average 1.7824933687002653) internal successors, (672), 582 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 678 transitions. [2024-11-08 18:23:56,563 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 678 transitions. Word has length 66 [2024-11-08 18:23:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:56,564 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 678 transitions. [2024-11-08 18:23:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 678 transitions. [2024-11-08 18:23:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 18:23:56,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:56,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:56,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:23:56,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash 562725700, now seen corresponding path program 1 times [2024-11-08 18:23:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:56,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125378223] [2024-11-08 18:23:56,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:23:56,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:56,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125378223] [2024-11-08 18:23:56,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125378223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:56,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:56,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:23:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758945204] [2024-11-08 18:23:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:56,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:23:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:23:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:56,785 INFO L87 Difference]: Start difference. First operand 587 states and 678 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:56,842 INFO L93 Difference]: Finished difference Result 683 states and 801 transitions. [2024-11-08 18:23:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:23:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-08 18:23:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:56,845 INFO L225 Difference]: With dead ends: 683 [2024-11-08 18:23:56,846 INFO L226 Difference]: Without dead ends: 683 [2024-11-08 18:23:56,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:23:56,846 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 54 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:56,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1164 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:23:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-08 18:23:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-11-08 18:23:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 473 states have (on average 1.6807610993657505) internal successors, (795), 678 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 801 transitions. [2024-11-08 18:23:56,862 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 801 transitions. Word has length 74 [2024-11-08 18:23:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:56,863 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 801 transitions. [2024-11-08 18:23:56,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 801 transitions. [2024-11-08 18:23:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 18:23:56,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:56,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:23:56,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:56,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 796825283, now seen corresponding path program 1 times [2024-11-08 18:23:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908423037] [2024-11-08 18:23:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:57,461 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-08 18:23:57,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908423037] [2024-11-08 18:23:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908423037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:57,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:57,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:23:57,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017626894] [2024-11-08 18:23:57,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:57,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:23:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:57,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:23:57,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:23:57,464 INFO L87 Difference]: Start difference. First operand 683 states and 801 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:58,242 INFO L93 Difference]: Finished difference Result 645 states and 763 transitions. [2024-11-08 18:23:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:23:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-08 18:23:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:58,245 INFO L225 Difference]: With dead ends: 645 [2024-11-08 18:23:58,245 INFO L226 Difference]: Without dead ends: 645 [2024-11-08 18:23:58,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:23:58,246 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 926 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:58,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 481 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:23:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-08 18:23:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 605. [2024-11-08 18:23:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5658198614318706) internal successors, (678), 600 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-08 18:23:58,258 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 77 [2024-11-08 18:23:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:58,258 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-08 18:23:58,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-08 18:23:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 18:23:58,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:58,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:58,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:23:58,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:58,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash 853132439, now seen corresponding path program 1 times [2024-11-08 18:23:58,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:58,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367527318] [2024-11-08 18:23:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:58,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:58,589 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-08 18:23:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367527318] [2024-11-08 18:23:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367527318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:58,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:23:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771563477] [2024-11-08 18:23:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:23:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:58,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:23:58,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:58,591 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:23:59,245 INFO L93 Difference]: Finished difference Result 604 states and 683 transitions. [2024-11-08 18:23:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:23:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-08 18:23:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:23:59,249 INFO L225 Difference]: With dead ends: 604 [2024-11-08 18:23:59,249 INFO L226 Difference]: Without dead ends: 604 [2024-11-08 18:23:59,249 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-08 18:23:59,250 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:23:59,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1528 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:23:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-08 18:23:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-11-08 18:23:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 433 states have (on average 1.5635103926096998) internal successors, (677), 599 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:23:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-08 18:23:59,262 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 82 [2024-11-08 18:23:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:23:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-08 18:23:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:23:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-08 18:23:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 18:23:59,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:23:59,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:23:59,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:23:59,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:23:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:23:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 853132440, now seen corresponding path program 1 times [2024-11-08 18:23:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:23:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060168252] [2024-11-08 18:23:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:23:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:23:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:23:59,835 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-08 18:23:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:23:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060168252] [2024-11-08 18:23:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060168252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:23:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:23:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:23:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864731684] [2024-11-08 18:23:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:23:59,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:23:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:23:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:23:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:23:59,838 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:24:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:00,561 INFO L93 Difference]: Finished difference Result 603 states and 682 transitions. [2024-11-08 18:24:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:24:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-08 18:24:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:00,564 INFO L225 Difference]: With dead ends: 603 [2024-11-08 18:24:00,564 INFO L226 Difference]: Without dead ends: 603 [2024-11-08 18:24:00,564 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-08 18:24:00,565 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 1 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:00,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1537 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:24:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-08 18:24:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2024-11-08 18:24:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 432 states have (on average 1.5648148148148149) internal successors, (676), 598 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:24:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 682 transitions. [2024-11-08 18:24:00,578 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 682 transitions. Word has length 82 [2024-11-08 18:24:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:00,579 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 682 transitions. [2024-11-08 18:24:00,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:24:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 682 transitions. [2024-11-08 18:24:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:24:00,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:00,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:00,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:24:00,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:00,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2144581854, now seen corresponding path program 1 times [2024-11-08 18:24:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:00,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533858862] [2024-11-08 18:24:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:00,979 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-08 18:24:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533858862] [2024-11-08 18:24:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533858862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:00,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:24:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017415253] [2024-11-08 18:24:00,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:00,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:24:00,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:24:00,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:24:00,983 INFO L87 Difference]: Start difference. First operand 603 states and 682 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:01,880 INFO L93 Difference]: Finished difference Result 615 states and 697 transitions. [2024-11-08 18:24:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:24:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-08 18:24:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:01,884 INFO L225 Difference]: With dead ends: 615 [2024-11-08 18:24:01,885 INFO L226 Difference]: Without dead ends: 615 [2024-11-08 18:24:01,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:24:01,885 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 10 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:01,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2354 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:24:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-08 18:24:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2024-11-08 18:24:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 437 states have (on average 1.562929061784897) internal successors, (683), 603 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:24:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 692 transitions. [2024-11-08 18:24:01,899 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 692 transitions. Word has length 90 [2024-11-08 18:24:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:01,899 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 692 transitions. [2024-11-08 18:24:01,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 692 transitions. [2024-11-08 18:24:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:24:01,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:01,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:24:01,901 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:01,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2144581855, now seen corresponding path program 1 times [2024-11-08 18:24:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:01,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411962511] [2024-11-08 18:24:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:02,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:02,624 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-08 18:24:02,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411962511] [2024-11-08 18:24:02,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411962511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:02,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:02,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:24:02,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211300899] [2024-11-08 18:24:02,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:02,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:24:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:24:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:24:02,627 INFO L87 Difference]: Start difference. First operand 609 states and 692 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:03,535 INFO L93 Difference]: Finished difference Result 609 states and 691 transitions. [2024-11-08 18:24:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:24:03,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-08 18:24:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:03,538 INFO L225 Difference]: With dead ends: 609 [2024-11-08 18:24:03,538 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:24:03,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:24:03,539 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 5 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:03,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2393 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:24:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:24:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:24:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 437 states have (on average 1.5606407322654463) internal successors, (682), 603 states have internal predecessors, (682), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:24:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 691 transitions. [2024-11-08 18:24:03,552 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 691 transitions. Word has length 90 [2024-11-08 18:24:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:03,552 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 691 transitions. [2024-11-08 18:24:03,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 691 transitions. [2024-11-08 18:24:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:24:03,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:03,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:03,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:24:03,554 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -930241591, now seen corresponding path program 1 times [2024-11-08 18:24:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:03,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393319763] [2024-11-08 18:24:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:04,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393319763] [2024-11-08 18:24:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393319763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311792181] [2024-11-08 18:24:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:04,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:04,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:24:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:04,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 18:24:04,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:04,648 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:04,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 11 treesize of output 11 [2024-11-08 18:24:04,673 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-08 18:24:04,787 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:04,787 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-08 18:24:04,835 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-08 18:24:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:04,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:04,907 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 18:24:04,908 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-08 18:24:04,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-08 18:24:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311792181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:04,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-08 18:24:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219560150] [2024-11-08 18:24:04,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:24:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:24:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-08 18:24:04,931 INFO L87 Difference]: Start difference. First operand 609 states and 691 transitions. Second operand has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:24:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:06,708 INFO L93 Difference]: Finished difference Result 608 states and 690 transitions. [2024-11-08 18:24:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:24:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-08 18:24:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:06,712 INFO L225 Difference]: With dead ends: 608 [2024-11-08 18:24:06,712 INFO L226 Difference]: Without dead ends: 608 [2024-11-08 18:24:06,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-08 18:24:06,717 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 507 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:06,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2858 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 18:24:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-08 18:24:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-08 18:24:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 437 states have (on average 1.5583524027459954) internal successors, (681), 602 states have internal predecessors, (681), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:24:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 690 transitions. [2024-11-08 18:24:06,731 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 690 transitions. Word has length 91 [2024-11-08 18:24:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:06,732 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 690 transitions. [2024-11-08 18:24:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:24:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 690 transitions. [2024-11-08 18:24:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:24:06,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:06,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:06,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:24:06,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 18:24:06,934 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -930241590, now seen corresponding path program 1 times [2024-11-08 18:24:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680496930] [2024-11-08 18:24:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:07,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:07,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680496930] [2024-11-08 18:24:07,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680496930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452089865] [2024-11-08 18:24:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:07,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:07,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:07,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:24:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:08,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 18:24:08,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:08,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:08,354 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-08 18:24:08,363 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-08 18:24:08,378 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-08 18:24:08,385 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-08 18:24:08,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:24:08,509 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-08 18:24:08,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:08,651 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-08 18:24:08,657 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-08 18:24:08,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 31 treesize of output 13 [2024-11-08 18:24:08,704 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-08 18:24:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:08,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452089865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:08,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-08 18:24:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817018723] [2024-11-08 18:24:08,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:24:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:24:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=278, Unknown=8, NotChecked=0, Total=342 [2024-11-08 18:24:08,901 INFO L87 Difference]: Start difference. First operand 608 states and 690 transitions. Second operand has 16 states, 13 states have (on average 8.461538461538462) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:10,730 INFO L93 Difference]: Finished difference Result 615 states and 697 transitions. [2024-11-08 18:24:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:24:10,731 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.461538461538462) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2024-11-08 18:24:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:10,733 INFO L225 Difference]: With dead ends: 615 [2024-11-08 18:24:10,733 INFO L226 Difference]: Without dead ends: 615 [2024-11-08 18:24:10,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=451, Unknown=9, NotChecked=0, Total=552 [2024-11-08 18:24:10,734 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 483 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:10,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2158 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:24:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-08 18:24:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 606. [2024-11-08 18:24:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 436 states have (on average 1.5573394495412844) internal successors, (679), 600 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:24:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 685 transitions. [2024-11-08 18:24:10,746 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 685 transitions. Word has length 91 [2024-11-08 18:24:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:10,746 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 685 transitions. [2024-11-08 18:24:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.461538461538462) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 685 transitions. [2024-11-08 18:24:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 18:24:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:10,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:10,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:24:10,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 18:24:10,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:10,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1600093258, now seen corresponding path program 1 times [2024-11-08 18:24:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303710183] [2024-11-08 18:24:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:11,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:11,596 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-08 18:24:11,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:11,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303710183] [2024-11-08 18:24:11,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303710183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:11,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:11,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:24:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484146425] [2024-11-08 18:24:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:11,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:24:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:24:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:24:11,599 INFO L87 Difference]: Start difference. First operand 606 states and 685 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:13,053 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2024-11-08 18:24:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:24:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-08 18:24:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:13,055 INFO L225 Difference]: With dead ends: 619 [2024-11-08 18:24:13,056 INFO L226 Difference]: Without dead ends: 619 [2024-11-08 18:24:13,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:24:13,056 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 493 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:13,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2855 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:24:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-08 18:24:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-08 18:24:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 444 states have (on average 1.5518018018018018) internal successors, (689), 608 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 696 transitions. [2024-11-08 18:24:13,068 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 696 transitions. Word has length 93 [2024-11-08 18:24:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:13,069 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 696 transitions. [2024-11-08 18:24:13,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 696 transitions. [2024-11-08 18:24:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 18:24:13,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:13,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:13,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:24:13,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:13,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1600093259, now seen corresponding path program 1 times [2024-11-08 18:24:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663424392] [2024-11-08 18:24:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:13,964 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-08 18:24:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663424392] [2024-11-08 18:24:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663424392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:13,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:24:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382352386] [2024-11-08 18:24:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:13,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:24:13,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:24:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:24:13,969 INFO L87 Difference]: Start difference. First operand 615 states and 696 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:15,704 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2024-11-08 18:24:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:24:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-08 18:24:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:15,707 INFO L225 Difference]: With dead ends: 618 [2024-11-08 18:24:15,707 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 18:24:15,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:24:15,708 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 485 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:15,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 2158 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 18:24:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 18:24:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-08 18:24:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 444 states have (on average 1.5495495495495495) internal successors, (688), 608 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 695 transitions. [2024-11-08 18:24:15,724 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 695 transitions. Word has length 93 [2024-11-08 18:24:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:15,724 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 695 transitions. [2024-11-08 18:24:15,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 695 transitions. [2024-11-08 18:24:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:24:15,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:15,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:15,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:24:15,726 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1697634945, now seen corresponding path program 1 times [2024-11-08 18:24:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399901603] [2024-11-08 18:24:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399901603] [2024-11-08 18:24:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399901603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286127946] [2024-11-08 18:24:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:16,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:16,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:16,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:16,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:24:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:16,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 18:24:16,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:16,803 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:16,804 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-08 18:24:16,811 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-08 18:24:16,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:16,884 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-08 18:24:16,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:16,936 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-08 18:24:16,949 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-08 18:24:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:16,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:16,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 18:24:17,037 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 18:24:17,037 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 32 [2024-11-08 18:24:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286127946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:17,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:17,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2024-11-08 18:24:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081992389] [2024-11-08 18:24:17,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:17,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:24:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:24:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=277, Unknown=16, NotChecked=34, Total=380 [2024-11-08 18:24:17,080 INFO L87 Difference]: Start difference. First operand 615 states and 695 transitions. Second operand has 17 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:18,547 INFO L93 Difference]: Finished difference Result 617 states and 699 transitions. [2024-11-08 18:24:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:24:18,547 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-08 18:24:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:18,550 INFO L225 Difference]: With dead ends: 617 [2024-11-08 18:24:18,550 INFO L226 Difference]: Without dead ends: 617 [2024-11-08 18:24:18,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=574, Unknown=17, NotChecked=50, Total=756 [2024-11-08 18:24:18,551 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 501 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:18,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2861 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:24:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-08 18:24:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-08 18:24:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 444 states have (on average 1.5472972972972974) internal successors, (687), 607 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 694 transitions. [2024-11-08 18:24:18,563 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 694 transitions. Word has length 94 [2024-11-08 18:24:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:18,563 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 694 transitions. [2024-11-08 18:24:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 694 transitions. [2024-11-08 18:24:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:24:18,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:18,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:18,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:24:18,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:18,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1697634944, now seen corresponding path program 1 times [2024-11-08 18:24:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222080200] [2024-11-08 18:24:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222080200] [2024-11-08 18:24:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222080200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704174010] [2024-11-08 18:24:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:19,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:19,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:19,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:19,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:24:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:20,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 18:24:20,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:20,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:20,124 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-08 18:24:20,151 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-08 18:24:20,155 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-08 18:24:20,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:20,364 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-08 18:24:20,369 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-08 18:24:20,464 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:20,464 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-08 18:24:20,473 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-08 18:24:20,496 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-08 18:24:20,503 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-08 18:24:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:20,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:20,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1040 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:24:20,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:24:20,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2024-11-08 18:24:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704174010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:20,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2024-11-08 18:24:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889920220] [2024-11-08 18:24:20,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:20,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:24:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:24:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=548, Unknown=20, NotChecked=48, Total=702 [2024-11-08 18:24:20,922 INFO L87 Difference]: Start difference. First operand 614 states and 694 transitions. Second operand has 22 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:23,860 INFO L93 Difference]: Finished difference Result 616 states and 698 transitions. [2024-11-08 18:24:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:24:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-08 18:24:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:23,863 INFO L225 Difference]: With dead ends: 616 [2024-11-08 18:24:23,863 INFO L226 Difference]: Without dead ends: 616 [2024-11-08 18:24:23,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=830, Unknown=24, NotChecked=60, Total=1056 [2024-11-08 18:24:23,864 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 482 mSDsluCounter, 4066 mSDsCounter, 0 mSdLazyCounter, 4394 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:23,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4395 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 18:24:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-08 18:24:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2024-11-08 18:24:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 436 states have (on average 1.5527522935779816) internal successors, (677), 598 states have internal predecessors, (677), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:24:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-08 18:24:23,877 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 94 [2024-11-08 18:24:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:23,878 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-08 18:24:23,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-08 18:24:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 18:24:23,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:23,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:23,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:24:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:24,084 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:24,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1463153530, now seen corresponding path program 1 times [2024-11-08 18:24:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439448650] [2024-11-08 18:24:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439448650] [2024-11-08 18:24:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439448650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:24:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814031610] [2024-11-08 18:24:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:24:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:24:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:24:25,252 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:26,963 INFO L93 Difference]: Finished difference Result 620 states and 702 transitions. [2024-11-08 18:24:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:24:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-08 18:24:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:26,966 INFO L225 Difference]: With dead ends: 620 [2024-11-08 18:24:26,966 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 18:24:26,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:24:26,967 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 506 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:26,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 2484 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 18:24:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 18:24:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 616. [2024-11-08 18:24:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 447 states have (on average 1.5436241610738255) internal successors, (690), 609 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 697 transitions. [2024-11-08 18:24:26,979 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 697 transitions. Word has length 96 [2024-11-08 18:24:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:26,979 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 697 transitions. [2024-11-08 18:24:26,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 697 transitions. [2024-11-08 18:24:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 18:24:26,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:26,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:26,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:24:26,981 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:26,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1463153531, now seen corresponding path program 1 times [2024-11-08 18:24:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:26,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242532158] [2024-11-08 18:24:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:27,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:27,709 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-08 18:24:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242532158] [2024-11-08 18:24:27,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242532158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:27,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:27,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:24:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977451217] [2024-11-08 18:24:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:27,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:24:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:24:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:24:27,712 INFO L87 Difference]: Start difference. First operand 616 states and 697 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:29,053 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2024-11-08 18:24:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:24:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-08 18:24:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:29,056 INFO L225 Difference]: With dead ends: 619 [2024-11-08 18:24:29,056 INFO L226 Difference]: Without dead ends: 619 [2024-11-08 18:24:29,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-08 18:24:29,057 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 490 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:29,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2543 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 18:24:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-08 18:24:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-08 18:24:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 447 states have (on average 1.541387024608501) internal successors, (689), 609 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 696 transitions. [2024-11-08 18:24:29,069 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 696 transitions. Word has length 96 [2024-11-08 18:24:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:29,070 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 696 transitions. [2024-11-08 18:24:29,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 696 transitions. [2024-11-08 18:24:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:24:29,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:29,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:29,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:24:29,072 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1002120399, now seen corresponding path program 1 times [2024-11-08 18:24:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126007706] [2024-11-08 18:24:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126007706] [2024-11-08 18:24:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126007706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787755951] [2024-11-08 18:24:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:30,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:30,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:30,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:24:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:30,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 18:24:30,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:30,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:30,704 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-08 18:24:30,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:24:30,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:30,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:24:30,895 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 18:24:30,896 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 69 treesize of output 41 [2024-11-08 18:24:30,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:24:31,070 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:24:31,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-08 18:24:31,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-08 18:24:31,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 18:24:31,139 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 39 treesize of output 21 [2024-11-08 18:24:31,143 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 34 treesize of output 16 [2024-11-08 18:24:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:31,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:31,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:24:31,402 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 112 treesize of output 116 [2024-11-08 18:24:31,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem53#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1326 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326))) (or (< (select (select (store .cse0 .cse1 v_prenex_7) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 9 |c_ULTIMATE.start_main_#t~mem53#1.offset|)) (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0)))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326))) (or (< (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0) (< 0 (+ 9 (select (select (store .cse3 .cse1 v_ArrVal_1328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (or (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse4 .cse1 v_ArrVal_1327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~mem53#1.base|)) (and (forall ((v_ArrVal_1326 (Array Int Int))) (< (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_1326 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1326))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse5 .cse1 v_ArrVal_1328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) 0))))))))) is different from false [2024-11-08 18:24:31,538 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 992 treesize of output 938 [2024-11-08 18:24:31,557 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 688 treesize of output 680 [2024-11-08 18:24:31,567 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 680 treesize of output 672 [2024-11-08 18:24:31,577 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 672 treesize of output 668 [2024-11-08 18:24:31,588 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 668 treesize of output 660 [2024-11-08 18:24:31,598 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 660 treesize of output 652 [2024-11-08 18:24:31,608 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 652 treesize of output 644 [2024-11-08 18:24:31,618 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 644 treesize of output 636 [2024-11-08 18:24:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787755951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:31,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:31,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-08 18:24:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010129381] [2024-11-08 18:24:31,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:31,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 18:24:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:31,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 18:24:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=4, NotChecked=56, Total=930 [2024-11-08 18:24:31,779 INFO L87 Difference]: Start difference. First operand 616 states and 696 transitions. Second operand has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:34,360 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2024-11-08 18:24:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:24:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-08 18:24:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:34,363 INFO L225 Difference]: With dead ends: 618 [2024-11-08 18:24:34,363 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 18:24:34,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=4, NotChecked=70, Total=1406 [2024-11-08 18:24:34,364 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 501 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:34,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3691 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:24:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 18:24:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-08 18:24:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 447 states have (on average 1.5391498881431767) internal successors, (688), 608 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 695 transitions. [2024-11-08 18:24:34,376 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 695 transitions. Word has length 97 [2024-11-08 18:24:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:34,377 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 695 transitions. [2024-11-08 18:24:34,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 695 transitions. [2024-11-08 18:24:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:24:34,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:34,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:34,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:24:34,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-08 18:24:34,580 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:34,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1002120400, now seen corresponding path program 1 times [2024-11-08 18:24:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:34,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075131013] [2024-11-08 18:24:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:35,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075131013] [2024-11-08 18:24:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075131013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045050475] [2024-11-08 18:24:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:35,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:35,378 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:35,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:24:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:35,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 18:24:35,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:35,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:35,728 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-08 18:24:35,737 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-08 18:24:35,845 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:35,846 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-08 18:24:35,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:35,894 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-08 18:24:35,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:35,943 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-08 18:24:35,955 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-08 18:24:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:35,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:36,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 18:24:36,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1481))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1482)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:24:36,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1481))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1482)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:24:36,072 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-08 18:24:36,072 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 57 treesize of output 56 [2024-11-08 18:24:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045050475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:36,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:36,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 19 [2024-11-08 18:24:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795799190] [2024-11-08 18:24:36,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:36,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:24:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:36,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:24:36,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=383, Unknown=19, NotChecked=126, Total=600 [2024-11-08 18:24:36,130 INFO L87 Difference]: Start difference. First operand 615 states and 695 transitions. Second operand has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 19 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:24:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:37,889 INFO L93 Difference]: Finished difference Result 617 states and 699 transitions. [2024-11-08 18:24:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:24:37,890 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 19 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-08 18:24:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:37,892 INFO L225 Difference]: With dead ends: 617 [2024-11-08 18:24:37,892 INFO L226 Difference]: Without dead ends: 617 [2024-11-08 18:24:37,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=779, Unknown=21, NotChecked=180, Total=1122 [2024-11-08 18:24:37,893 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 495 mSDsluCounter, 3776 mSDsCounter, 0 mSdLazyCounter, 3044 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:37,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 4106 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 18:24:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-08 18:24:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 602. [2024-11-08 18:24:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 436 states have (on average 1.548165137614679) internal successors, (675), 596 states have internal predecessors, (675), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:24:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 681 transitions. [2024-11-08 18:24:37,904 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 681 transitions. Word has length 97 [2024-11-08 18:24:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:37,905 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 681 transitions. [2024-11-08 18:24:37,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.666666666666667) internal successors, (120), 19 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:24:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 681 transitions. [2024-11-08 18:24:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:24:37,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:37,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:37,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 18:24:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-08 18:24:38,107 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:38,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 816867729, now seen corresponding path program 1 times [2024-11-08 18:24:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325329026] [2024-11-08 18:24:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:38,908 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-08 18:24:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325329026] [2024-11-08 18:24:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325329026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:24:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167780613] [2024-11-08 18:24:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:24:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:24:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:24:38,911 INFO L87 Difference]: Start difference. First operand 602 states and 681 transitions. Second operand has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:40,086 INFO L93 Difference]: Finished difference Result 621 states and 703 transitions. [2024-11-08 18:24:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:24:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-08 18:24:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:40,088 INFO L225 Difference]: With dead ends: 621 [2024-11-08 18:24:40,088 INFO L226 Difference]: Without dead ends: 621 [2024-11-08 18:24:40,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-08 18:24:40,089 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 495 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:40,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2538 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:24:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-08 18:24:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2024-11-08 18:24:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 450 states have (on average 1.5355555555555556) internal successors, (691), 610 states have internal predecessors, (691), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 698 transitions. [2024-11-08 18:24:40,101 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 698 transitions. Word has length 99 [2024-11-08 18:24:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:40,102 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 698 transitions. [2024-11-08 18:24:40,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 698 transitions. [2024-11-08 18:24:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:24:40,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:40,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:40,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:24:40,104 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:40,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 816867730, now seen corresponding path program 1 times [2024-11-08 18:24:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142251838] [2024-11-08 18:24:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142251838] [2024-11-08 18:24:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142251838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:24:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316734179] [2024-11-08 18:24:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:24:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:24:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:24:41,166 INFO L87 Difference]: Start difference. First operand 617 states and 698 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:43,033 INFO L93 Difference]: Finished difference Result 620 states and 702 transitions. [2024-11-08 18:24:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:24:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-08 18:24:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:43,035 INFO L225 Difference]: With dead ends: 620 [2024-11-08 18:24:43,035 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 18:24:43,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:24:43,036 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 488 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:43,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2675 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:24:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 18:24:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2024-11-08 18:24:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 450 states have (on average 1.5333333333333334) internal successors, (690), 610 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 697 transitions. [2024-11-08 18:24:43,048 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 697 transitions. Word has length 99 [2024-11-08 18:24:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 697 transitions. [2024-11-08 18:24:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:24:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 697 transitions. [2024-11-08 18:24:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:24:43,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:43,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:43,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:24:43,050 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:43,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash 149460742, now seen corresponding path program 1 times [2024-11-08 18:24:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686529768] [2024-11-08 18:24:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:43,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686529768] [2024-11-08 18:24:43,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686529768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:43,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391691373] [2024-11-08 18:24:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:43,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:43,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:43,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:24:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:44,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 18:24:44,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:44,263 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:44,264 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-08 18:24:44,270 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-08 18:24:44,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:44,363 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-08 18:24:44,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:44,416 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-08 18:24:44,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:44,473 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-08 18:24:44,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:44,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 18:24:44,543 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-08 18:24:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:44,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:44,641 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1788))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:24:44,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1787))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:24:48,919 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-08 18:24:48,919 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 105 treesize of output 104 [2024-11-08 18:24:48,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1792))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1789)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 18:24:48,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391691373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:48,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2024-11-08 18:24:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98163741] [2024-11-08 18:24:48,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:48,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:24:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:24:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=525, Unknown=36, NotChecked=150, Total=812 [2024-11-08 18:24:48,934 INFO L87 Difference]: Start difference. First operand 617 states and 697 transitions. Second operand has 22 states, 20 states have (on average 6.25) internal successors, (125), 21 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:24:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:51,231 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2024-11-08 18:24:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:24:51,232 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.25) internal successors, (125), 21 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-08 18:24:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:51,235 INFO L225 Difference]: With dead ends: 619 [2024-11-08 18:24:51,235 INFO L226 Difference]: Without dead ends: 619 [2024-11-08 18:24:51,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=197, Invalid=1038, Unknown=37, NotChecked=210, Total=1482 [2024-11-08 18:24:51,236 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 499 mSDsluCounter, 3438 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3767 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:51,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3767 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 18:24:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-08 18:24:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-08 18:24:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 450 states have (on average 1.531111111111111) internal successors, (689), 609 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:24:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 696 transitions. [2024-11-08 18:24:51,247 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 696 transitions. Word has length 100 [2024-11-08 18:24:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 696 transitions. [2024-11-08 18:24:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.25) internal successors, (125), 21 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:24:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 696 transitions. [2024-11-08 18:24:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:24:51,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:51,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:51,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 18:24:51,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 18:24:51,450 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:51,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash 149460743, now seen corresponding path program 1 times [2024-11-08 18:24:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235690565] [2024-11-08 18:24:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:52,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235690565] [2024-11-08 18:24:52,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235690565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114508041] [2024-11-08 18:24:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:52,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:24:52,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:24:52,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:24:52,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:24:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:52,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 18:24:52,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:24:53,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 8 treesize of output 1 [2024-11-08 18:24:53,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:24:53,155 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-08 18:24:53,200 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-08 18:24:53,212 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-08 18:24:53,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:24:53,348 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-08 18:24:53,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:53,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 18:24:53,511 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-08 18:24:53,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:53,628 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-08 18:24:53,641 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-08 18:24:53,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:53,741 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-08 18:24:53,749 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-08 18:24:53,823 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:24:53,824 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-08 18:24:53,829 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-08 18:24:53,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-08 18:24:53,867 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-08 18:24:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:24:53,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:24:53,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:24:54,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1960) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1960) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-08 18:24:54,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1959))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1958) .cse0 v_ArrVal_1960) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1958) .cse5 v_ArrVal_1960) (select (select (store .cse6 .cse5 v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-08 18:24:54,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1959))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1960) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1958) .cse6 v_ArrVal_1960) (select (select (store .cse7 .cse6 v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-08 18:24:54,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1959))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1968) .cse0 v_ArrVal_1958) .cse1 v_ArrVal_1960) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1968 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1957))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1968) .cse7 v_ArrVal_1958) .cse8 v_ArrVal_1960) (select (select (store .cse9 .cse8 v_ArrVal_1959) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-08 18:24:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114508041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:24:54,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:24:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-08 18:24:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538088351] [2024-11-08 18:24:54,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:24:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 18:24:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 18:24:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=684, Unknown=24, NotChecked=290, Total=1122 [2024-11-08 18:24:54,392 INFO L87 Difference]: Start difference. First operand 616 states and 696 transitions. Second operand has 25 states, 22 states have (on average 6.090909090909091) internal successors, (134), 24 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:24:58,674 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2024-11-08 18:24:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:24:58,674 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.090909090909091) internal successors, (134), 24 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-08 18:24:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:24:58,676 INFO L225 Difference]: With dead ends: 618 [2024-11-08 18:24:58,676 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 18:24:58,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=1122, Unknown=24, NotChecked=370, Total=1722 [2024-11-08 18:24:58,678 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 482 mSDsluCounter, 3866 mSDsCounter, 0 mSdLazyCounter, 4573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:24:58,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4197 Invalid, 4594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4573 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 18:24:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 18:24:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 600. [2024-11-08 18:24:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 436 states have (on average 1.5435779816513762) internal successors, (673), 594 states have internal predecessors, (673), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:24:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 679 transitions. [2024-11-08 18:24:58,694 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 679 transitions. Word has length 100 [2024-11-08 18:24:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:24:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 679 transitions. [2024-11-08 18:24:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.090909090909091) internal successors, (134), 24 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:24:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 679 transitions. [2024-11-08 18:24:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:24:58,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:24:58,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:24:58,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 18:24:58,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 18:24:58,896 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:24:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:24:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash 695798739, now seen corresponding path program 1 times [2024-11-08 18:24:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:24:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370161385] [2024-11-08 18:24:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:24:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:24:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:24:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:24:59,848 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-08 18:24:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:24:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370161385] [2024-11-08 18:24:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370161385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:24:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:24:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:24:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321877264] [2024-11-08 18:24:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:24:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:24:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:24:59,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:24:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:24:59,851 INFO L87 Difference]: Start difference. First operand 600 states and 679 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:01,815 INFO L93 Difference]: Finished difference Result 623 states and 705 transitions. [2024-11-08 18:25:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:25:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-08 18:25:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:01,817 INFO L225 Difference]: With dead ends: 623 [2024-11-08 18:25:01,818 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 18:25:01,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:25:01,818 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 492 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:01,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2800 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:25:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 18:25:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 619. [2024-11-08 18:25:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 454 states have (on average 1.526431718061674) internal successors, (693), 612 states have internal predecessors, (693), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:25:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 700 transitions. [2024-11-08 18:25:01,829 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 700 transitions. Word has length 103 [2024-11-08 18:25:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:01,830 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 700 transitions. [2024-11-08 18:25:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 700 transitions. [2024-11-08 18:25:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:25:01,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:01,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 18:25:01,831 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 695798740, now seen corresponding path program 1 times [2024-11-08 18:25:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074139695] [2024-11-08 18:25:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:03,291 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-08 18:25:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074139695] [2024-11-08 18:25:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074139695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:03,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:25:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710602915] [2024-11-08 18:25:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:03,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:25:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:25:03,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:25:03,293 INFO L87 Difference]: Start difference. First operand 619 states and 700 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:06,713 INFO L93 Difference]: Finished difference Result 622 states and 704 transitions. [2024-11-08 18:25:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:25:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-08 18:25:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:06,715 INFO L225 Difference]: With dead ends: 622 [2024-11-08 18:25:06,715 INFO L226 Difference]: Without dead ends: 622 [2024-11-08 18:25:06,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-08 18:25:06,716 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 488 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:06,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2983 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 18:25:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-08 18:25:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 619. [2024-11-08 18:25:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 454 states have (on average 1.524229074889868) internal successors, (692), 612 states have internal predecessors, (692), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:25:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 699 transitions. [2024-11-08 18:25:06,728 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 699 transitions. Word has length 103 [2024-11-08 18:25:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:06,728 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 699 transitions. [2024-11-08 18:25:06,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 699 transitions. [2024-11-08 18:25:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 18:25:06,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:06,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:06,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 18:25:06,730 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1505528120, now seen corresponding path program 1 times [2024-11-08 18:25:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790008940] [2024-11-08 18:25:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:07,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790008940] [2024-11-08 18:25:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790008940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261741825] [2024-11-08 18:25:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:07,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:25:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:25:07,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:25:07,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:25:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:08,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 18:25:08,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:25:08,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:25:08,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 18:25:08,194 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-08 18:25:08,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:08,283 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-08 18:25:08,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:08,326 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-08 18:25:08,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:08,411 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-08 18:25:08,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:08,477 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-08 18:25:08,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:08,553 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-08 18:25:08,568 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-08 18:25:08,589 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 18:25:08,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-08 18:25:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:08,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:25:09,637 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-08 18:25:09,637 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 597 treesize of output 794 [2024-11-08 18:25:09,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261741825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:09,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:25:09,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2024-11-08 18:25:09,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379244792] [2024-11-08 18:25:09,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:25:09,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:25:09,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:25:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=866, Unknown=50, NotChecked=0, Total=1056 [2024-11-08 18:25:09,788 INFO L87 Difference]: Start difference. First operand 619 states and 699 transitions. Second operand has 22 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:12,542 INFO L93 Difference]: Finished difference Result 621 states and 703 transitions. [2024-11-08 18:25:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:25:12,543 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-08 18:25:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:12,545 INFO L225 Difference]: With dead ends: 621 [2024-11-08 18:25:12,545 INFO L226 Difference]: Without dead ends: 621 [2024-11-08 18:25:12,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=1575, Unknown=50, NotChecked=0, Total=1892 [2024-11-08 18:25:12,549 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 475 mSDsluCounter, 4054 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 4382 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:12,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 4382 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 18:25:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-08 18:25:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2024-11-08 18:25:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 454 states have (on average 1.5220264317180616) internal successors, (691), 611 states have internal predecessors, (691), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:25:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 698 transitions. [2024-11-08 18:25:12,574 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 698 transitions. Word has length 104 [2024-11-08 18:25:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:12,577 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 698 transitions. [2024-11-08 18:25:12,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 698 transitions. [2024-11-08 18:25:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 18:25:12,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:12,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:12,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 18:25:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 18:25:12,779 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1505528119, now seen corresponding path program 1 times [2024-11-08 18:25:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183244749] [2024-11-08 18:25:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183244749] [2024-11-08 18:25:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183244749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081248305] [2024-11-08 18:25:14,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:25:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:25:14,259 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:25:14,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:25:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:14,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 18:25:14,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:25:14,669 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-08 18:25:14,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:25:14,678 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-08 18:25:14,719 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-08 18:25:14,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-08 18:25:14,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:25:14,865 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-08 18:25:15,126 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:15,127 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 73 treesize of output 66 [2024-11-08 18:25:15,135 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-08 18:25:15,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:15,345 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 73 treesize of output 66 [2024-11-08 18:25:15,350 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-08 18:25:15,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:15,507 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 73 treesize of output 66 [2024-11-08 18:25:15,516 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-08 18:25:15,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:15,664 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 73 treesize of output 66 [2024-11-08 18:25:15,673 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-08 18:25:15,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:15,819 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 73 treesize of output 66 [2024-11-08 18:25:15,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:25:15,857 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 42 treesize of output 18 [2024-11-08 18:25:15,864 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-08 18:25:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:25:15,946 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-08 18:25:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-08 18:25:15,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:25:15,965 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-08 18:25:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:16,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:25:18,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2492))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2491) .cse1 v_ArrVal_2493) .cse2 v_ArrVal_2494) (select (select (store .cse3 .cse2 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2497))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2490 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (forall ((v_ArrVal_2498 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2492))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2495))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2491) .cse6 v_ArrVal_2493) .cse7 v_ArrVal_2494) .cse8 v_ArrVal_2497) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2498) (select (select (store .cse9 .cse8 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-08 18:25:19,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:25:19,016 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 604 treesize of output 622 [2024-11-08 18:25:19,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_19))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_27))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_20) .cse0 v_prenex_28) .cse1 v_prenex_26) .cse2 v_prenex_25) (select (select (store .cse3 .cse2 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_23))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_7| |c_ULTIMATE.start_main_#t~mem51#1.base|) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2504 (Array Int Int)) (v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2498 Int) (v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2503))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2490))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2492))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2495))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2504) .cse7 v_ArrVal_2491) .cse8 v_ArrVal_2493) .cse9 v_ArrVal_2494) .cse10 v_ArrVal_2497) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2498) (select (select (store .cse11 .cse10 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-08 18:25:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081248305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:19,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:25:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2024-11-08 18:25:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339006788] [2024-11-08 18:25:19,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:25:19,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 18:25:19,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 18:25:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1495, Unknown=50, NotChecked=162, Total=1892 [2024-11-08 18:25:19,412 INFO L87 Difference]: Start difference. First operand 618 states and 698 transitions. Second operand has 32 states, 29 states have (on average 4.896551724137931) internal successors, (142), 30 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:25:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:26,021 INFO L93 Difference]: Finished difference Result 620 states and 702 transitions. [2024-11-08 18:25:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:25:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.896551724137931) internal successors, (142), 30 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-08 18:25:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:26,023 INFO L225 Difference]: With dead ends: 620 [2024-11-08 18:25:26,023 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 18:25:26,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=340, Invalid=2588, Unknown=50, NotChecked=214, Total=3192 [2024-11-08 18:25:26,024 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 504 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 5217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:26,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 4624 Invalid, 5240 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5217 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-08 18:25:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 18:25:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 598. [2024-11-08 18:25:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 436 states have (on average 1.5389908256880733) internal successors, (671), 592 states have internal predecessors, (671), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:25:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 677 transitions. [2024-11-08 18:25:26,040 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 677 transitions. Word has length 104 [2024-11-08 18:25:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:26,040 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 677 transitions. [2024-11-08 18:25:26,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.896551724137931) internal successors, (142), 30 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:25:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 677 transitions. [2024-11-08 18:25:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:25:26,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:26,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:26,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 18:25:26,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:25:26,242 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:26,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1028700594, now seen corresponding path program 1 times [2024-11-08 18:25:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268904634] [2024-11-08 18:25:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:27,079 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-08 18:25:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268904634] [2024-11-08 18:25:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268904634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:25:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496966259] [2024-11-08 18:25:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:25:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:25:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:25:27,081 INFO L87 Difference]: Start difference. First operand 598 states and 677 transitions. Second operand has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:29,457 INFO L93 Difference]: Finished difference Result 624 states and 706 transitions. [2024-11-08 18:25:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:25:29,458 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-08 18:25:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:29,460 INFO L225 Difference]: With dead ends: 624 [2024-11-08 18:25:29,460 INFO L226 Difference]: Without dead ends: 624 [2024-11-08 18:25:29,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:25:29,461 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 510 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:29,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3476 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:25:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-08 18:25:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 620. [2024-11-08 18:25:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 457 states have (on average 1.5185995623632385) internal successors, (694), 613 states have internal predecessors, (694), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:25:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 701 transitions. [2024-11-08 18:25:29,471 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 701 transitions. Word has length 106 [2024-11-08 18:25:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 701 transitions. [2024-11-08 18:25:29,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 701 transitions. [2024-11-08 18:25:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:25:29,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:29,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:29,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 18:25:29,473 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:29,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1028700595, now seen corresponding path program 1 times [2024-11-08 18:25:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829086294] [2024-11-08 18:25:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829086294] [2024-11-08 18:25:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829086294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:25:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110986216] [2024-11-08 18:25:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:30,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:25:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:25:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:25:31,000 INFO L87 Difference]: Start difference. First operand 620 states and 701 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:34,519 INFO L93 Difference]: Finished difference Result 623 states and 705 transitions. [2024-11-08 18:25:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:25:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-08 18:25:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:34,522 INFO L225 Difference]: With dead ends: 623 [2024-11-08 18:25:34,522 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 18:25:34,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-08 18:25:34,523 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 488 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:34,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2996 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 18:25:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 18:25:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2024-11-08 18:25:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 457 states have (on average 1.5164113785557987) internal successors, (693), 613 states have internal predecessors, (693), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:25:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 700 transitions. [2024-11-08 18:25:34,534 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 700 transitions. Word has length 106 [2024-11-08 18:25:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:34,534 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 700 transitions. [2024-11-08 18:25:34,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 700 transitions. [2024-11-08 18:25:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:25:34,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:34,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:34,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 18:25:34,536 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:34,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1155886749, now seen corresponding path program 1 times [2024-11-08 18:25:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643542522] [2024-11-08 18:25:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643542522] [2024-11-08 18:25:35,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643542522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:35,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785701366] [2024-11-08 18:25:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:35,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:25:35,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:25:35,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:25:35,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:25:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:35,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 18:25:35,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:25:35,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:25:35,984 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-08 18:25:35,992 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-08 18:25:36,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:36,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:25:36,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:36,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:25:36,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:25:36,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:36,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:25:36,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:36,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:25:36,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:36,344 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-08 18:25:36,397 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-08 18:25:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:36,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:25:36,421 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-08 18:25:36,421 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-08 18:25:36,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2866 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem57#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2866) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-08 18:25:36,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:25:36,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2864))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2865)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:25:36,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2864))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2865)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:25:36,632 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2863))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2864)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2865)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 18:25:36,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int)) (v_ArrVal_2862 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2862))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2863)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2864)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2865)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:25:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785701366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:40,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:25:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 22 [2024-11-08 18:25:40,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876880874] [2024-11-08 18:25:40,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:25:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 18:25:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 18:25:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=594, Unknown=30, NotChecked=330, Total=1056 [2024-11-08 18:25:40,179 INFO L87 Difference]: Start difference. First operand 620 states and 700 transitions. Second operand has 23 states, 21 states have (on average 6.190476190476191) internal successors, (130), 22 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:44,582 INFO L93 Difference]: Finished difference Result 622 states and 704 transitions. [2024-11-08 18:25:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:25:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.190476190476191) internal successors, (130), 22 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-08 18:25:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:44,586 INFO L225 Difference]: With dead ends: 622 [2024-11-08 18:25:44,586 INFO L226 Difference]: Without dead ends: 622 [2024-11-08 18:25:44,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=190, Invalid=1136, Unknown=30, NotChecked=450, Total=1806 [2024-11-08 18:25:44,588 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 505 mSDsluCounter, 4703 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 5033 SdHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:44,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 5033 Invalid, 3736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 18:25:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-08 18:25:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 619. [2024-11-08 18:25:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 457 states have (on average 1.5142231947483589) internal successors, (692), 612 states have internal predecessors, (692), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:25:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 699 transitions. [2024-11-08 18:25:44,598 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 699 transitions. Word has length 107 [2024-11-08 18:25:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:44,599 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 699 transitions. [2024-11-08 18:25:44,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.190476190476191) internal successors, (130), 22 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:25:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 699 transitions. [2024-11-08 18:25:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:25:44,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:44,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:25:44,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 18:25:44,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 18:25:44,801 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:25:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1155886750, now seen corresponding path program 1 times [2024-11-08 18:25:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51004728] [2024-11-08 18:25:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:25:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51004728] [2024-11-08 18:25:46,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51004728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812664441] [2024-11-08 18:25:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:46,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:25:46,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:25:46,581 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:25:46,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 18:25:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:46,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 18:25:46,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:25:47,358 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-08 18:25:47,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:25:47,374 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-08 18:25:47,456 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-08 18:25:47,477 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-08 18:25:47,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:25:47,691 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-08 18:25:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:25:47,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2024-11-08 18:25:48,006 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 39 treesize of output 20 [2024-11-08 18:25:48,471 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:25:48,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 73 [2024-11-08 18:25:48,481 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 39 treesize of output 20 [2024-11-08 18:25:48,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 18:25:48,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:48,773 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 73 treesize of output 66 [2024-11-08 18:25:48,779 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-08 18:25:49,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:49,023 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 73 treesize of output 66 [2024-11-08 18:25:49,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:25:49,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:49,267 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 73 treesize of output 66 [2024-11-08 18:25:49,274 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-08 18:25:49,480 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-08 18:25:49,481 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 17 treesize of output 17 [2024-11-08 18:25:49,508 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-08 18:25:49,509 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-08 18:25:49,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:25:49,655 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 88 treesize of output 79 [2024-11-08 18:25:49,668 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 52 treesize of output 16 [2024-11-08 18:25:49,854 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 20 [2024-11-08 18:25:49,864 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 35 treesize of output 13 [2024-11-08 18:25:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:49,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:25:52,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int) (v_ArrVal_3072 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3065)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3064) .cse6 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (< v_ArrVal_3071 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse1 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|)))))))) is different from false [2024-11-08 18:25:52,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int) (v_ArrVal_3072 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3065))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3064) .cse7 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse1 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< v_ArrVal_3071 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_11|) 0))))))))))) is different from false [2024-11-08 18:25:52,193 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 18:25:52,193 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 12 [2024-11-08 18:25:52,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3062 (Array Int Int)) (v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3063)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3065))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3062) .cse6 v_ArrVal_3064) .cse7 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_11| |c_ULTIMATE.start_main_#t~mem53#1.base|) (< v_ArrVal_3071 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse1 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0)))))))))) is different from false [2024-11-08 18:25:53,841 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_11| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_55| Int) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3062 (Array Int Int)) (v_ArrVal_3063 (Array Int Int)) (v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3067 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem57#1.offset_13| Int) (|v_#Ultimate.C_memset#1_#ptr.offset_29| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_55| |v_#Ultimate.C_memset#1_#ptr.offset_29|) 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3063))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3065))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3066))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3077) .cse6 v_ArrVal_3062) .cse7 v_ArrVal_3064) .cse8 v_ArrVal_3067) .cse5 v_ArrVal_3069))) (or (< 0 |v_#Ultimate.C_memset#1_#t~loopctr160_55|) (< |c_ULTIMATE.start_main_#t~mem51#1.offset| |v_#Ultimate.C_memset#1_#ptr.offset_29|) (< v_ArrVal_3071 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem57#1.offset_13|) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3068))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 43 (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem57#1.offset_13| v_ArrVal_3071)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_11| v_ArrVal_3070) (select (select (store .cse3 .cse2 v_ArrVal_3072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem57#1.offset_13| 0) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_11| .cse6)))))))))))) is different from false [2024-11-08 18:25:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812664441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:25:53,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:25:53,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2024-11-08 18:25:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196901819] [2024-11-08 18:25:53,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:25:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 18:25:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:53,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 18:25:53,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1982, Unknown=54, NotChecked=380, Total=2652 [2024-11-08 18:25:53,850 INFO L87 Difference]: Start difference. First operand 619 states and 699 transitions. Second operand has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 37 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:26:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:04,773 INFO L93 Difference]: Finished difference Result 627 states and 710 transitions. [2024-11-08 18:26:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 18:26:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 37 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-08 18:26:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:04,776 INFO L225 Difference]: With dead ends: 627 [2024-11-08 18:26:04,776 INFO L226 Difference]: Without dead ends: 627 [2024-11-08 18:26:04,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=566, Invalid=4222, Unknown=58, NotChecked=556, Total=5402 [2024-11-08 18:26:04,778 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1397 mSDsluCounter, 5324 mSDsCounter, 0 mSdLazyCounter, 6991 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 5649 SdHoareTripleChecker+Invalid, 7035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 6991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:04,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1401 Valid, 5649 Invalid, 7035 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 6991 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-08 18:26:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-08 18:26:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 596. [2024-11-08 18:26:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 436 states have (on average 1.5344036697247707) internal successors, (669), 590 states have internal predecessors, (669), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:26:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 675 transitions. [2024-11-08 18:26:04,786 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 675 transitions. Word has length 107 [2024-11-08 18:26:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:04,787 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 675 transitions. [2024-11-08 18:26:04,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 5.885714285714286) internal successors, (206), 37 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:26:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 675 transitions. [2024-11-08 18:26:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:26:04,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:04,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:04,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 18:26:04,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-08 18:26:04,989 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1428383386, now seen corresponding path program 1 times [2024-11-08 18:26:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856896350] [2024-11-08 18:26:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:05,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:05,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-08 18:26:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856896350] [2024-11-08 18:26:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856896350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:05,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:26:05,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899853355] [2024-11-08 18:26:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:05,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:26:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:05,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:26:05,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:26:05,770 INFO L87 Difference]: Start difference. First operand 596 states and 675 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:07,685 INFO L93 Difference]: Finished difference Result 647 states and 731 transitions. [2024-11-08 18:26:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:26:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-08 18:26:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:07,688 INFO L225 Difference]: With dead ends: 647 [2024-11-08 18:26:07,688 INFO L226 Difference]: Without dead ends: 647 [2024-11-08 18:26:07,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:26:07,692 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 582 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:07,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2575 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:26:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-08 18:26:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 621. [2024-11-08 18:26:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 460 states have (on average 1.5108695652173914) internal successors, (695), 614 states have internal predecessors, (695), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:26:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 702 transitions. [2024-11-08 18:26:07,702 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 702 transitions. Word has length 109 [2024-11-08 18:26:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 702 transitions. [2024-11-08 18:26:07,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 702 transitions. [2024-11-08 18:26:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:26:07,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:07,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:07,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 18:26:07,704 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1428383387, now seen corresponding path program 1 times [2024-11-08 18:26:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:07,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759607993] [2024-11-08 18:26:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:08,940 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-08 18:26:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759607993] [2024-11-08 18:26:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759607993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:26:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332107475] [2024-11-08 18:26:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:08,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:26:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:26:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:26:08,942 INFO L87 Difference]: Start difference. First operand 621 states and 702 transitions. Second operand has 17 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:12,159 INFO L93 Difference]: Finished difference Result 646 states and 730 transitions. [2024-11-08 18:26:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:26:12,160 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-08 18:26:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:12,162 INFO L225 Difference]: With dead ends: 646 [2024-11-08 18:26:12,162 INFO L226 Difference]: Without dead ends: 646 [2024-11-08 18:26:12,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:26:12,163 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 557 mSDsluCounter, 3623 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:12,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 3955 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 18:26:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-08 18:26:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 621. [2024-11-08 18:26:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 460 states have (on average 1.508695652173913) internal successors, (694), 614 states have internal predecessors, (694), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:26:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 701 transitions. [2024-11-08 18:26:12,173 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 701 transitions. Word has length 109 [2024-11-08 18:26:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:12,173 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 701 transitions. [2024-11-08 18:26:12,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 701 transitions. [2024-11-08 18:26:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:12,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:12,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:12,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 18:26:12,175 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995377, now seen corresponding path program 1 times [2024-11-08 18:26:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591919297] [2024-11-08 18:26:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:12,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:26:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591919297] [2024-11-08 18:26:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591919297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:12,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:26:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776264464] [2024-11-08 18:26:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:26:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:26:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:26:12,953 INFO L87 Difference]: Start difference. First operand 621 states and 701 transitions. Second operand has 11 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:15,046 INFO L93 Difference]: Finished difference Result 637 states and 719 transitions. [2024-11-08 18:26:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:26:15,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-08 18:26:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:15,048 INFO L225 Difference]: With dead ends: 637 [2024-11-08 18:26:15,048 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 18:26:15,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:26:15,049 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 986 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:15,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 2511 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:26:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 18:26:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 620. [2024-11-08 18:26:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 460 states have (on average 1.5065217391304349) internal successors, (693), 613 states have internal predecessors, (693), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:26:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 700 transitions. [2024-11-08 18:26:15,057 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 700 transitions. Word has length 110 [2024-11-08 18:26:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 700 transitions. [2024-11-08 18:26:15,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 700 transitions. [2024-11-08 18:26:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:15,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:15,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:15,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 18:26:15,059 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:15,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2024995376, now seen corresponding path program 1 times [2024-11-08 18:26:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:15,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338370822] [2024-11-08 18:26:15,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:16,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338370822] [2024-11-08 18:26:16,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338370822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214479930] [2024-11-08 18:26:16,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:16,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:26:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:16,914 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:26:16,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 18:26:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:17,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 18:26:17,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:17,753 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:26:17,753 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-08 18:26:17,816 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-08 18:26:17,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:26:17,922 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 7 [2024-11-08 18:26:18,076 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_56| Int)) (and (<= |v_#Ultimate.C_memset#1_#t~loopctr160_56| 0) (= (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_56| |c_#Ultimate.C_memset#1_#ptr.offset|) 0)) |c_#memory_$Pointer$#1.base|))) is different from true [2024-11-08 18:26:18,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:26:18,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2024-11-08 18:26:18,303 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 18:26:18,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-08 18:26:18,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:18,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:26:18,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:18,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:26:18,621 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:18,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:26:18,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:18,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 18:26:18,740 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-08 18:26:18,934 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:18,935 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 70 treesize of output 65 [2024-11-08 18:26:18,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 49 treesize of output 30 [2024-11-08 18:26:19,033 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 39 treesize of output 21 [2024-11-08 18:26:19,039 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 32 treesize of output 14 [2024-11-08 18:26:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 18:26:19,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:26:19,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:26:19,210 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-08 18:26:19,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem59#1.base|)) (forall ((v_prenex_29 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ 41 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (forall ((v_ArrVal_3569 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-08 18:26:19,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_29 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_29) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 41 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3569 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0))))) is different from false [2024-11-08 18:26:19,415 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 640 treesize of output 598 [2024-11-08 18:26:19,424 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 232 treesize of output 224 [2024-11-08 18:26:19,431 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 224 treesize of output 220 [2024-11-08 18:26:19,438 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 220 treesize of output 216 [2024-11-08 18:26:19,445 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 216 treesize of output 208 [2024-11-08 18:26:19,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3563 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:26:20,003 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3562 (Array Int Int)) (v_ArrVal_3563 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:26:20,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3562 (Array Int Int)) (v_ArrVal_3563 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-08 18:26:20,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_#Ultimate.C_memset#1_#t~loopctr160_61| Int) (v_ArrVal_3562 (Array Int Int)) (|v_#Ultimate.C_memset#1_#ptr.offset_32| Int) (v_ArrVal_3563 (Array Int Int))) (or (< |c_ULTIMATE.start_main_#t~mem51#1.offset| |v_#Ultimate.C_memset#1_#ptr.offset_32|) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_61| |v_#Ultimate.C_memset#1_#ptr.offset_32|) 0)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3562)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|)) (< 0 |v_#Ultimate.C_memset#1_#t~loopctr160_61|))) is different from false [2024-11-08 18:26:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214479930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:20,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:26:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2024-11-08 18:26:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252284367] [2024-11-08 18:26:20,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:26:20,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 18:26:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:20,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 18:26:20,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1809, Unknown=19, NotChecked=644, Total=2652 [2024-11-08 18:26:20,080 INFO L87 Difference]: Start difference. First operand 620 states and 700 transitions. Second operand has 39 states, 36 states have (on average 5.916666666666667) internal successors, (213), 38 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:26:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:27,313 INFO L93 Difference]: Finished difference Result 645 states and 730 transitions. [2024-11-08 18:26:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:26:27,314 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 5.916666666666667) internal successors, (213), 38 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-08 18:26:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:27,316 INFO L225 Difference]: With dead ends: 645 [2024-11-08 18:26:27,317 INFO L226 Difference]: Without dead ends: 645 [2024-11-08 18:26:27,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=385, Invalid=3406, Unknown=19, NotChecked=882, Total=4692 [2024-11-08 18:26:27,319 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1103 mSDsluCounter, 6588 mSDsCounter, 0 mSdLazyCounter, 6040 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 6911 SdHoareTripleChecker+Invalid, 6672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 6040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:27,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 6911 Invalid, 6672 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 6040 Invalid, 0 Unknown, 571 Unchecked, 6.1s Time] [2024-11-08 18:26:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-08 18:26:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 594. [2024-11-08 18:26:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 436 states have (on average 1.5298165137614679) internal successors, (667), 588 states have internal predecessors, (667), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:26:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 673 transitions. [2024-11-08 18:26:27,329 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 673 transitions. Word has length 110 [2024-11-08 18:26:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:27,329 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 673 transitions. [2024-11-08 18:26:27,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 5.916666666666667) internal successors, (213), 38 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:26:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 673 transitions. [2024-11-08 18:26:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:26:27,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:27,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:27,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 18:26:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-08 18:26:27,531 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1565852090, now seen corresponding path program 1 times [2024-11-08 18:26:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989178700] [2024-11-08 18:26:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:27,709 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-08 18:26:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989178700] [2024-11-08 18:26:27,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989178700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:27,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:27,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:27,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214873655] [2024-11-08 18:26:27,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:27,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:27,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:27,711 INFO L87 Difference]: Start difference. First operand 594 states and 673 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:28,501 INFO L93 Difference]: Finished difference Result 613 states and 695 transitions. [2024-11-08 18:26:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:28,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-08 18:26:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:28,502 INFO L225 Difference]: With dead ends: 613 [2024-11-08 18:26:28,502 INFO L226 Difference]: Without dead ends: 613 [2024-11-08 18:26:28,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:28,503 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 22 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:28,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1962 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:26:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-08 18:26:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 593. [2024-11-08 18:26:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 436 states have (on average 1.5275229357798166) internal successors, (666), 587 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:26:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 672 transitions. [2024-11-08 18:26:28,509 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 672 transitions. Word has length 112 [2024-11-08 18:26:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:28,509 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 672 transitions. [2024-11-08 18:26:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 672 transitions. [2024-11-08 18:26:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:26:28,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:28,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 18:26:28,511 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1565852089, now seen corresponding path program 1 times [2024-11-08 18:26:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622854880] [2024-11-08 18:26:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:28,811 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-08 18:26:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622854880] [2024-11-08 18:26:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622854880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:28,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455624411] [2024-11-08 18:26:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:28,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:28,814 INFO L87 Difference]: Start difference. First operand 593 states and 672 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:29,702 INFO L93 Difference]: Finished difference Result 612 states and 694 transitions. [2024-11-08 18:26:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:29,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-08 18:26:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:29,704 INFO L225 Difference]: With dead ends: 612 [2024-11-08 18:26:29,704 INFO L226 Difference]: Without dead ends: 612 [2024-11-08 18:26:29,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:29,705 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 21 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:29,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1968 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:26:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-08 18:26:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 592. [2024-11-08 18:26:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 436 states have (on average 1.525229357798165) internal successors, (665), 586 states have internal predecessors, (665), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:26:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 671 transitions. [2024-11-08 18:26:29,726 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 671 transitions. Word has length 112 [2024-11-08 18:26:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:29,728 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 671 transitions. [2024-11-08 18:26:29,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 671 transitions. [2024-11-08 18:26:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:26:29,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:29,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 18:26:29,730 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1296773858, now seen corresponding path program 1 times [2024-11-08 18:26:29,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60039690] [2024-11-08 18:26:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:31,302 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-08 18:26:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60039690] [2024-11-08 18:26:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60039690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:31,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:31,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 18:26:31,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33486241] [2024-11-08 18:26:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:31,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:26:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:26:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:26:31,304 INFO L87 Difference]: Start difference. First operand 592 states and 671 transitions. Second operand has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:34,860 INFO L93 Difference]: Finished difference Result 640 states and 724 transitions. [2024-11-08 18:26:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:26:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-08 18:26:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:34,862 INFO L225 Difference]: With dead ends: 640 [2024-11-08 18:26:34,862 INFO L226 Difference]: Without dead ends: 640 [2024-11-08 18:26:34,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 18:26:34,863 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 562 mSDsluCounter, 4319 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 4645 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:34,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 4645 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 18:26:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-08 18:26:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 621. [2024-11-08 18:26:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 464 states have (on average 1.4956896551724137) internal successors, (694), 614 states have internal predecessors, (694), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 18:26:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 703 transitions. [2024-11-08 18:26:34,874 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 703 transitions. Word has length 113 [2024-11-08 18:26:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 703 transitions. [2024-11-08 18:26:34,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 703 transitions. [2024-11-08 18:26:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:26:34,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:34,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 18:26:34,876 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:34,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1296773857, now seen corresponding path program 1 times [2024-11-08 18:26:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:34,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410552226] [2024-11-08 18:26:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:36,844 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-08 18:26:36,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410552226] [2024-11-08 18:26:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410552226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:36,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:26:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094949744] [2024-11-08 18:26:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:36,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:26:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:26:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:26:36,846 INFO L87 Difference]: Start difference. First operand 621 states and 703 transitions. Second operand has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:39,849 INFO L93 Difference]: Finished difference Result 639 states and 723 transitions. [2024-11-08 18:26:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:26:39,849 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-08 18:26:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:39,851 INFO L225 Difference]: With dead ends: 639 [2024-11-08 18:26:39,851 INFO L226 Difference]: Without dead ends: 639 [2024-11-08 18:26:39,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 18:26:39,852 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 555 mSDsluCounter, 2894 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:39,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 3218 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:26:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-08 18:26:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 621. [2024-11-08 18:26:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 463 states have (on average 1.4967602591792657) internal successors, (693), 614 states have internal predecessors, (693), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 18:26:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 702 transitions. [2024-11-08 18:26:39,860 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 702 transitions. Word has length 113 [2024-11-08 18:26:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:39,864 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 702 transitions. [2024-11-08 18:26:39,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:26:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 702 transitions. [2024-11-08 18:26:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 18:26:39,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:39,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:39,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 18:26:39,865 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1809959379, now seen corresponding path program 1 times [2024-11-08 18:26:39,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:39,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560941520] [2024-11-08 18:26:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560941520] [2024-11-08 18:26:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560941520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160312817] [2024-11-08 18:26:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:26:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:41,508 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:26:41,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 18:26:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:41,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 18:26:41,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:42,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:26:42,056 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-08 18:26:42,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:26:42,095 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-08 18:26:42,206 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:42,207 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 51 treesize of output 48 [2024-11-08 18:26:42,213 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 20 treesize of output 1 [2024-11-08 18:26:42,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:42,274 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 51 treesize of output 48 [2024-11-08 18:26:42,278 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 20 treesize of output 1 [2024-11-08 18:26:42,339 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:42,339 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 51 treesize of output 48 [2024-11-08 18:26:42,343 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 20 treesize of output 1 [2024-11-08 18:26:42,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:42,408 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 51 treesize of output 48 [2024-11-08 18:26:42,411 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 20 treesize of output 1 [2024-11-08 18:26:42,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:42,472 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 51 treesize of output 48 [2024-11-08 18:26:42,476 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 20 treesize of output 1 [2024-11-08 18:26:42,581 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-08 18:26:42,696 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 18:26:42,696 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 97 treesize of output 63 [2024-11-08 18:26:42,700 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 42 treesize of output 25 [2024-11-08 18:26:42,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:26:42,937 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 18:26:42,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-08 18:26:42,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-08 18:26:42,981 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 19 [2024-11-08 18:26:43,062 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-08 18:26:43,063 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 39 treesize of output 16 [2024-11-08 18:26:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:43,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:26:43,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|) .cse2 (select v_ArrVal_4145 .cse2))))))) is different from false [2024-11-08 18:26:43,112 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4145 .cse2))) v_ArrVal_4145)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-08 18:26:43,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))) v_ArrVal_4145)) (= (select |c_#valid| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))) is different from false [2024-11-08 18:26:43,171 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 272 treesize of output 184 [2024-11-08 18:26:43,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))) v_ArrVal_4145)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:26:43,239 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4143)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4145))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4145 .cse5))) v_ArrVal_4145)))))))) is different from false [2024-11-08 18:26:43,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4140)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4145 .cse5))) v_ArrVal_4145)))))))) is different from false [2024-11-08 18:26:43,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4143))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-08 18:26:43,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4138)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4139) .cse9 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4143)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-08 18:26:43,674 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4138))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4139) .cse10 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4145 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-08 18:26:43,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4137)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4138))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4136) .cse9 v_ArrVal_4139) .cse10 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4143)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4145 .cse4))) v_ArrVal_4145)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))))))))))) is different from false [2024-11-08 18:26:43,842 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4140 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4137))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4138))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4136) .cse10 v_ArrVal_4139) .cse11 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4143))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 18:26:43,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4140 (Array Int Int)) (v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4134 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4135)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4137))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4138))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4134) .cse9 v_ArrVal_4136) .cse10 v_ArrVal_4139) .cse11 v_ArrVal_4141))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4143))) (or (not (= v_ArrVal_4145 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4145 .cse2))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4145))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 18:26:44,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4140 (Array Int Int)) (v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4134 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4135))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4137))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4138))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4134) .cse10 v_ArrVal_4136) .cse11 v_ArrVal_4139) .cse12 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4143))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4145 .cse5))) v_ArrVal_4145)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-08 18:26:44,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4151 (Array Int Int)) (v_ArrVal_4140 (Array Int Int)) (v_ArrVal_4152 (Array Int Int)) (v_ArrVal_4141 (Array Int Int)) (v_ArrVal_4143 (Array Int Int)) (v_ArrVal_4134 (Array Int Int)) (v_ArrVal_4145 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4146 (Array Int Int)) (v_ArrVal_4136 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4139 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4151)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4135))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4137))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4138))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4152) .cse9 v_ArrVal_4134) .cse10 v_ArrVal_4136) .cse11 v_ArrVal_4139) .cse12 v_ArrVal_4141))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4143))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4145))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4145 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4145 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-08 18:26:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160312817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:44,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:26:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2024-11-08 18:26:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237853465] [2024-11-08 18:26:44,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:26:44,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 18:26:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 18:26:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1024, Unknown=14, NotChecked=1078, Total=2256 [2024-11-08 18:26:44,191 INFO L87 Difference]: Start difference. First operand 621 states and 702 transitions. Second operand has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 33 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:26:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:48,923 INFO L93 Difference]: Finished difference Result 637 states and 721 transitions. [2024-11-08 18:26:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:26:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 33 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2024-11-08 18:26:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:48,925 INFO L225 Difference]: With dead ends: 637 [2024-11-08 18:26:48,926 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 18:26:48,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=258, Invalid=2040, Unknown=14, NotChecked=1470, Total=3782 [2024-11-08 18:26:48,927 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 514 mSDsluCounter, 5960 mSDsCounter, 0 mSdLazyCounter, 4740 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 6286 SdHoareTripleChecker+Invalid, 4767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4740 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:48,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 6286 Invalid, 4767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4740 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 18:26:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 18:26:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 620. [2024-11-08 18:26:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 463 states have (on average 1.4946004319654427) internal successors, (692), 613 states have internal predecessors, (692), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 18:26:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 701 transitions. [2024-11-08 18:26:48,932 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 701 transitions. Word has length 114 [2024-11-08 18:26:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:48,933 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 701 transitions. [2024-11-08 18:26:48,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 33 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:26:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 701 transitions. [2024-11-08 18:26:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 18:26:48,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:48,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:26:48,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 18:26:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-08 18:26:49,134 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:26:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1809959380, now seen corresponding path program 1 times [2024-11-08 18:26:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365665527] [2024-11-08 18:26:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:26:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:51,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:51,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365665527] [2024-11-08 18:26:51,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365665527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:51,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543708438] [2024-11-08 18:26:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:51,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:26:51,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:51,880 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:26:51,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 18:26:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:52,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 18:26:52,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:52,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:26:52,411 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-08 18:26:52,447 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-08 18:26:52,451 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-08 18:26:52,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:52,589 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 51 treesize of output 48 [2024-11-08 18:26:52,594 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 20 treesize of output 1 [2024-11-08 18:26:52,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:52,682 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 51 treesize of output 48 [2024-11-08 18:26:52,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-08 18:26:52,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:52,772 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 51 treesize of output 48 [2024-11-08 18:26:52,776 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 20 treesize of output 1 [2024-11-08 18:26:52,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:52,859 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 51 treesize of output 48 [2024-11-08 18:26:52,863 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 20 treesize of output 1 [2024-11-08 18:26:52,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:52,954 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 51 treesize of output 48 [2024-11-08 18:26:52,961 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 20 treesize of output 1 [2024-11-08 18:26:53,048 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-08 18:26:53,145 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 18:26:53,145 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 106 treesize of output 72 [2024-11-08 18:26:53,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-08 18:26:53,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:26:53,323 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 18:26:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-08 18:26:53,342 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-08 18:26:53,343 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 87 treesize of output 47 [2024-11-08 18:26:53,576 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 18:26:53,576 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 70 treesize of output 29 [2024-11-08 18:26:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:53,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:26:53,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (and (forall ((v_ArrVal_4370 (Array Int Int))) (or (forall ((v_ArrVal_4369 Int)) (<= 0 (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse2 .cse3 v_ArrVal_4369)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (store .cse4 .cse3 (select v_ArrVal_4370 .cse3)) v_ArrVal_4370)))) (forall ((v_ArrVal_4370 (Array Int Int))) (or (not (= (store .cse4 .cse3 (select v_ArrVal_4370 .cse3)) v_ArrVal_4370)) (forall ((v_ArrVal_4369 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse2 .cse3 v_ArrVal_4369))) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4370))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select .cse5 .cse6) .cse7) 384) (select |c_#length| (select (select .cse8 .cse6) .cse7)))))))))) is different from false [2024-11-08 18:26:53,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse7 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4369 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 (store .cse6 .cse7 v_ArrVal_4369))) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_4370))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= v_ArrVal_4370 (store .cse8 .cse7 (select v_ArrVal_4370 .cse7))))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse9) (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store .cse8 .cse10 (select v_ArrVal_4370 .cse10)))) (forall ((v_ArrVal_4369 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse5 (store .cse6 .cse10 v_ArrVal_4369)))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 18:26:53,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.offset|)))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (select .cse4 .cse2)) (.cse7 (select .cse1 .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4369 Int)) (<= 0 (let ((.cse0 (store .cse4 .cse2 (store .cse5 .cse6 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4370 .cse6)) v_ArrVal_4370))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse8))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse8) (forall ((v_ArrVal_4370 (Array Int Int))) (let ((.cse13 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4369 Int)) (let ((.cse9 (store .cse4 .cse2 (store .cse5 .cse13 v_ArrVal_4369))) (.cse12 (store .cse1 .cse2 v_ArrVal_4370))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 384 (select (select .cse9 .cse10) .cse11)) (select |c_#length| (select (select .cse12 .cse10) .cse11)))))) (not (= (store .cse7 .cse13 (select v_ArrVal_4370 .cse13)) v_ArrVal_4370))))))))))) is different from false [2024-11-08 18:26:54,000 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 942 treesize of output 820 [2024-11-08 18:26:54,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| 0))) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= (store (select .cse1 .cse2) .cse5 (select v_ArrVal_4370 .cse5)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse6))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (+ 40 v_prenex_35))) (or (< 0 (+ (let ((.cse8 (store .cse4 .cse10 (store (select .cse4 .cse10) .cse11 v_prenex_34)))) (select (select .cse8 (select (select (store .cse9 .cse10 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= (store (select .cse9 .cse10) .cse11 (select v_prenex_36 .cse11)) v_prenex_36)) (< v_prenex_35 .cse6))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse15 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_4370))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse4 .cse14 (store (select .cse4 .cse14) .cse15 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4370 .cse15)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse6)))))))) is different from false [2024-11-08 18:26:55,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4363)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4370 (store (select .cse1 .cse2) .cse5 (select v_ArrVal_4370 .cse5)))))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4363)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4362))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_4370))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse13 .cse12 (store (select .cse13 .cse12) .cse14 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4370 (store (select .cse11 .cse12) .cse14 (select v_ArrVal_4370 .cse14)))))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4363)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4362))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse20 .cse21) .cse22 (select v_prenex_36 .cse22)) v_prenex_36)) (< 0 (+ (let ((.cse23 (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_prenex_34)))) (select (select .cse23 (select (select (store .cse20 .cse21 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)))))))))) is different from false [2024-11-08 18:26:55,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4363)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_34)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_36 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_36 .cse5))))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4363)) (.cse13 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4362))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse20 (store .cse21 .cse14 (store (select .cse21 .cse14) .cse15 0)))) (or (not (= (store (let ((.cse12 (store .cse13 .cse14 (store v_ArrVal_4362 .cse15 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse16 (select v_ArrVal_4370 .cse16)) v_ArrVal_4370)) (< (let ((.cse18 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse20 .cse19 (store (select .cse20 .cse19) .cse16 v_ArrVal_4369)))) (select (select .cse17 (select (select (store .cse18 .cse19 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4363)) (.cse30 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4362))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse29 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 0))) (.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse22 .cse23) .cse24 (select v_ArrVal_4370 .cse24)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse26 (store .cse22 .cse23 v_ArrVal_4370))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse23 (store (select .cse25 .cse23) .cse24 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-08 18:26:57,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse6 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_34)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_36 .cse5)) v_prenex_36))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4360))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4361) .cse23 v_ArrVal_4363)) (.cse21 (store .cse22 .cse23 v_ArrVal_4362))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 0))) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4370 .cse15)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse17 (store .cse13 .cse14 v_ArrVal_4370))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse16 .cse14 (store (select .cse16 .cse14) .cse15 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4360))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4361) .cse35 v_ArrVal_4363)) (.cse25 (store .cse34 .cse35 v_ArrVal_4362))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse33 .cse26 (store (select .cse33 .cse26) .cse27 0))) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (let ((.cse24 (store .cse25 .cse26 (store v_ArrVal_4362 .cse27 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse28 (select v_ArrVal_4370 .cse28)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse31 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse29 .cse32 (store (select .cse29 .cse32) .cse28 v_ArrVal_4369)))) (select (select .cse30 (select (select (store .cse31 .cse32 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) is different from false [2024-11-08 18:26:59,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4360))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4361) .cse11 v_ArrVal_4363)) (.cse9 (store .cse10 .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4370))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4370 (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4370 .cse5)))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4360))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4361) .cse24 v_ArrVal_4363)) (.cse18 (store .cse23 .cse24 v_ArrVal_4362))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 0))) (.cse17 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse15 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse13 .cse16 (store (select .cse13 .cse16) .cse17 v_prenex_34)))) (select (select .cse14 (select (select (store .cse15 .cse16 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= (store (let ((.cse21 (store .cse18 .cse19 (store v_ArrVal_4362 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse17 (select v_prenex_36 .cse17)) v_prenex_36))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4360))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4361) .cse36 v_ArrVal_4363)) (.cse26 (store .cse35 .cse36 v_ArrVal_4362))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse33 (store .cse34 .cse27 (store (select .cse34 .cse27) .cse28 0)))) (or (not (= v_ArrVal_4370 (store (let ((.cse25 (store .cse26 .cse27 (store v_ArrVal_4362 .cse28 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse29 (select v_ArrVal_4370 .cse29)))) (< (let ((.cse31 (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse33 .cse32 (store (select .cse33 .cse32) .cse29 v_ArrVal_4369)))) (select (select .cse30 (select (select (store .cse31 .cse32 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-08 18:27:14,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4358))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4359) .cse13 v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse6 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (+ 40 v_prenex_35)) (.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (or (< 0 (+ (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_prenex_34)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_prenex_36 .cse5)) v_prenex_36)) (< v_prenex_35 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4358))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4360))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4359) .cse27 v_ArrVal_4361) .cse26 v_ArrVal_4363)) (.cse20 (store .cse25 .cse26 v_ArrVal_4362))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse18 (store .cse24 .cse21 (store (select .cse24 .cse21) .cse22 0)))) (or (< (let ((.cse16 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse15 (store .cse18 .cse17 (store (select .cse18 .cse17) .cse19 v_ArrVal_4369)))) (select (select .cse15 (select (select (store .cse16 .cse17 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (not (= v_ArrVal_4370 (store (let ((.cse23 (store .cse20 .cse21 (store v_ArrVal_4362 .cse22 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse19 (select v_ArrVal_4370 .cse19)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4358))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4360))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4359) .cse40 v_ArrVal_4361) .cse39 v_ArrVal_4363)) (.cse37 (store .cse38 .cse39 v_ArrVal_4362))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse29 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse31 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse33 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0)))) (or (not (= (store (select .cse29 .cse30) .cse31 (select v_ArrVal_4370 .cse31)) v_ArrVal_4370)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse32 (store .cse29 .cse30 v_ArrVal_4370))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse33 .cse30 (store (select .cse33 .cse30) .cse31 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-08 18:27:14,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4358))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4359) .cse14 v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse2 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4362 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4370 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 (store (select .cse6 .cse9) .cse5 v_ArrVal_4369)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4369 Int) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4358))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4360))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4359) .cse27 v_ArrVal_4361) .cse26 v_ArrVal_4363)) (.cse24 (store .cse25 .cse26 v_ArrVal_4362))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4370 .cse18)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse20 (store .cse16 .cse17 v_ArrVal_4370))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse17 (store (select .cse19 .cse17) .cse18 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_prenex_34 Int) (v_prenex_35 Int) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4358))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4360))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4359) .cse41 v_ArrVal_4361) .cse40 v_ArrVal_4363)) (.cse30 (store .cse39 .cse40 v_ArrVal_4362))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (+ 40 v_prenex_35)) (.cse37 (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 0)))) (or (not (= v_prenex_36 (store (let ((.cse29 (store .cse30 .cse31 (store v_ArrVal_4362 .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse33 (select v_prenex_36 .cse33)))) (< 0 (+ (let ((.cse35 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse37 .cse36 (store (select .cse37 .cse36) .cse33 v_prenex_34)))) (select (select .cse34 (select (select (store .cse35 .cse36 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-08 18:27:15,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4357))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4358))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4360))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4356) .cse12 v_ArrVal_4359) .cse13 v_ArrVal_4361) .cse11 v_ArrVal_4363)) (.cse9 (store .cse10 .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4370 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4370 .cse2)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4370))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse31 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4357))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_4358))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse26 (store .cse30 .cse29 v_ArrVal_4360))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4356) .cse28 v_ArrVal_4359) .cse29 v_ArrVal_4361) .cse27 v_ArrVal_4363)) (.cse21 (store .cse26 .cse27 v_ArrVal_4362))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse23 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse25 .cse22 (store (select .cse25 .cse22) .cse23 0))) (.cse20 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse17 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse16 (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_4369)))) (select (select .cse16 (select (select (store .cse17 .cse18 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (not (= (store (let ((.cse24 (store .cse21 .cse22 (store v_ArrVal_4362 .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) .cse20 (select v_ArrVal_4370 .cse20)) v_ArrVal_4370))))))))))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4357))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4358))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4360))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4356) .cse44 v_ArrVal_4359) .cse45 v_ArrVal_4361) .cse43 v_ArrVal_4363)) (.cse33 (store .cse42 .cse43 v_ArrVal_4362))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse35 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse37 (store .cse41 .cse34 (store (select .cse41 .cse34) .cse35 0))) (.cse36 (+ 40 v_prenex_35))) (or (not (= v_prenex_36 (store (let ((.cse32 (store .cse33 .cse34 (store v_ArrVal_4362 .cse35 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) .cse36 (select v_prenex_36 .cse36)))) (< v_prenex_35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (< 0 (+ (let ((.cse39 (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse38 (store .cse37 .cse40 (store (select .cse37 .cse40) .cse36 v_prenex_34)))) (select (select .cse38 (select (select (store .cse39 .cse40 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) 1))))))))))))))) is different from false [2024-11-08 18:27:15,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4357))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4358))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4360))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4356) .cse13 v_ArrVal_4359) .cse14 v_ArrVal_4361) .cse11 v_ArrVal_4363)) (.cse9 (store .cse10 .cse11 v_ArrVal_4362))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0)))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4370))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (not (= (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4370 .cse5)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4357))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4358))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4360))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4356) .cse29 v_ArrVal_4359) .cse30 v_ArrVal_4361) .cse28 v_ArrVal_4363)) (.cse18 (store .cse27 .cse28 v_ArrVal_4362))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse26 .cse19 (store (select .cse26 .cse19) .cse20 0))) (.cse21 (+ 40 v_prenex_35))) (or (not (= (store (let ((.cse17 (store .cse18 .cse19 (store v_ArrVal_4362 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_36 .cse21)) v_prenex_36)) (< v_prenex_35 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse24 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse22 .cse25 (store (select .cse22 .cse25) .cse21 v_prenex_34)))) (select (select .cse23 (select (select (store .cse24 .cse25 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4357))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4358))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4360))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4356) .cse45 v_ArrVal_4359) .cse46 v_ArrVal_4361) .cse44 v_ArrVal_4363)) (.cse34 (store .cse43 .cse44 v_ArrVal_4362))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse42 .cse35 (store (select .cse42 .cse35) .cse36 0))) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (let ((.cse33 (store .cse34 .cse35 (store v_ArrVal_4362 .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse37 (select v_ArrVal_4370 .cse37)) v_ArrVal_4370)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse40 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse41 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse38 .cse41 (store (select .cse38 .cse41) .cse37 v_ArrVal_4369)))) (select (select .cse39 (select (select (store .cse40 .cse41 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))))) is different from false [2024-11-08 18:27:16,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4375))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4357))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4358))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4360))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4376) .cse13 v_ArrVal_4356) .cse14 v_ArrVal_4359) .cse15 v_ArrVal_4361) .cse12 v_ArrVal_4363)) (.cse6 (store .cse11 .cse12 v_ArrVal_4362))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (or (< (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4369)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (not (= v_ArrVal_4370 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4362 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4370 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))))) (forall ((v_prenex_34 Int) (v_prenex_35 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_ArrVal_4359 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4375))) (let ((.cse31 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse35 (store .cse36 .cse31 v_ArrVal_4357))) (let ((.cse32 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store .cse35 .cse32 v_ArrVal_4358))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse29 (store .cse34 .cse33 v_ArrVal_4360))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4376) .cse31 v_ArrVal_4356) .cse32 v_ArrVal_4359) .cse33 v_ArrVal_4361) .cse30 v_ArrVal_4363)) (.cse21 (store .cse29 .cse30 v_ArrVal_4362))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store .cse28 .cse22 (store (select .cse28 .cse22) .cse23 0))) (.cse24 (+ 40 v_prenex_35))) (or (< v_prenex_35 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (let ((.cse20 (store .cse21 .cse22 (store v_ArrVal_4362 .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse24 (select v_prenex_36 .cse24)) v_prenex_36)) (< 0 (+ (let ((.cse26 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse25 (store .cse19 .cse27 (store (select .cse19 .cse27) .cse24 v_prenex_34)))) (select (select .cse25 (select (select (store .cse26 .cse27 v_prenex_36) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1))))))))))))))) (forall ((v_ArrVal_4369 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4370 (Array Int Int)) (v_ArrVal_4360 (Array Int Int)) (v_ArrVal_4361 (Array Int Int)) (v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4375 (Array Int Int)) (v_ArrVal_4376 (Array Int Int)) (v_ArrVal_4356 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (v_ArrVal_4359 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4375))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4357))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4358))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4360))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse42 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4376) .cse48 v_ArrVal_4356) .cse49 v_ArrVal_4359) .cse50 v_ArrVal_4361) .cse47 v_ArrVal_4363)) (.cse45 (store .cse46 .cse47 v_ArrVal_4362))) (let ((.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse44 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse37 (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse39 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse41 (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 0)))) (or (not (= v_ArrVal_4370 (store (select .cse37 .cse38) .cse39 (select v_ArrVal_4370 .cse39)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse40 (store .cse37 .cse38 v_ArrVal_4370))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse41 .cse38 (store (select .cse41 .cse38) .cse39 v_ArrVal_4369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))))))) is different from false [2024-11-08 18:27:16,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543708438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:16,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:16,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 37 [2024-11-08 18:27:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259990753] [2024-11-08 18:27:16,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:16,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 18:27:16,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:16,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 18:27:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1572, Unknown=14, NotChecked=1196, Total=2970 [2024-11-08 18:27:16,488 INFO L87 Difference]: Start difference. First operand 620 states and 701 transitions. Second operand has 38 states, 35 states have (on average 4.514285714285714) internal successors, (158), 37 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:23,367 INFO L93 Difference]: Finished difference Result 636 states and 720 transitions. [2024-11-08 18:27:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 18:27:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.514285714285714) internal successors, (158), 37 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2024-11-08 18:27:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:23,370 INFO L225 Difference]: With dead ends: 636 [2024-11-08 18:27:23,370 INFO L226 Difference]: Without dead ends: 636 [2024-11-08 18:27:23,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=354, Invalid=2990, Unknown=14, NotChecked=1612, Total=4970 [2024-11-08 18:27:23,371 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 509 mSDsluCounter, 6205 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 6527 SdHoareTripleChecker+Invalid, 6014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:23,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 6527 Invalid, 6014 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 5985 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 18:27:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-08 18:27:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 590. [2024-11-08 18:27:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 435 states have (on average 1.5241379310344827) internal successors, (663), 584 states have internal predecessors, (663), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:27:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 669 transitions. [2024-11-08 18:27:23,379 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 669 transitions. Word has length 114 [2024-11-08 18:27:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:23,379 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 669 transitions. [2024-11-08 18:27:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.514285714285714) internal successors, (158), 37 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 669 transitions. [2024-11-08 18:27:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 18:27:23,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:23,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:27:23,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 18:27:23,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-08 18:27:23,581 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:27:23,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -365353752, now seen corresponding path program 1 times [2024-11-08 18:27:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908913712] [2024-11-08 18:27:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:27:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 18:27:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:27:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908913712] [2024-11-08 18:27:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908913712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:23,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:23,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:27:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251929109] [2024-11-08 18:27:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:23,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:27:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:23,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:27:23,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:27:23,716 INFO L87 Difference]: Start difference. First operand 590 states and 669 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:24,360 INFO L93 Difference]: Finished difference Result 700 states and 816 transitions. [2024-11-08 18:27:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:27:24,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-11-08 18:27:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:24,362 INFO L225 Difference]: With dead ends: 700 [2024-11-08 18:27:24,362 INFO L226 Difference]: Without dead ends: 700 [2024-11-08 18:27:24,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 18:27:24,363 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 899 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:24,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1014 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:27:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-08 18:27:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 694. [2024-11-08 18:27:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 546 states have (on average 1.467032967032967) internal successors, (801), 688 states have internal predecessors, (801), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:27:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 807 transitions. [2024-11-08 18:27:24,373 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 807 transitions. Word has length 123 [2024-11-08 18:27:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:24,373 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 807 transitions. [2024-11-08 18:27:24,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 807 transitions. [2024-11-08 18:27:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 18:27:24,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:24,375 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:27:24,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 18:27:24,375 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:27:24,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -365353751, now seen corresponding path program 1 times [2024-11-08 18:27:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553634941] [2024-11-08 18:27:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:27:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 18:27:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:27:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553634941] [2024-11-08 18:27:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553634941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:27:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191127254] [2024-11-08 18:27:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:24,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:27:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:27:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:27:24,575 INFO L87 Difference]: Start difference. First operand 694 states and 807 transitions. Second operand has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:25,398 INFO L93 Difference]: Finished difference Result 912 states and 1066 transitions. [2024-11-08 18:27:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:27:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-11-08 18:27:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:25,401 INFO L225 Difference]: With dead ends: 912 [2024-11-08 18:27:25,401 INFO L226 Difference]: Without dead ends: 912 [2024-11-08 18:27:25,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:27:25,401 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1360 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:25,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1160 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:27:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-08 18:27:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 860. [2024-11-08 18:27:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 712 states have (on average 1.4634831460674158) internal successors, (1042), 854 states have internal predecessors, (1042), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:27:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1048 transitions. [2024-11-08 18:27:25,413 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1048 transitions. Word has length 123 [2024-11-08 18:27:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:25,413 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1048 transitions. [2024-11-08 18:27:25,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1048 transitions. [2024-11-08 18:27:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:27:25,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:25,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:27:25,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 18:27:25,415 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:27:25,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1558936326, now seen corresponding path program 1 times [2024-11-08 18:27:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:25,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895533976] [2024-11-08 18:27:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:27:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 18:27:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 18:27:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895533976] [2024-11-08 18:27:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895533976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22537035] [2024-11-08 18:27:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:25,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:25,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:25,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 18:27:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:26,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 18:27:26,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:26,591 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:27:26,591 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-08 18:27:26,617 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-08 18:27:26,621 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-08 18:27:26,731 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 7 [2024-11-08 18:27:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:27:26,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-08 18:27:26,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:26,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:26,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:26,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:26,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:26,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:27,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:27,057 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-08 18:27:27,180 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:27,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 18:27:27,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:27:27,421 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-08 18:27:27,454 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-08 18:27:27,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:27,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4746 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4746) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-08 18:27:27,805 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 18:27:27,805 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 32 [2024-11-08 18:27:28,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4744)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4745))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-08 18:27:32,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4743))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:27:32,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4743))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:27:32,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4742))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:27:32,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4746 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4742))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:27:33,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4740 Int) (v_ArrVal_4746 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem53#1.offset|) v_ArrVal_4740)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4742)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4744)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4745))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 18:27:33,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4740 Int) (v_ArrVal_4746 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem53#1.offset_38| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store |c_#memory_$Pointer$#1.base| .cse7 (store (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_main_#t~mem53#1.offset_38| 16) v_ArrVal_4740))))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4742)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4743)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4744)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4745))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))) (< |v_ULTIMATE.start_main_#t~mem53#1.offset_38| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 18:27:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22537035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:33,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:33,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18] total 22 [2024-11-08 18:27:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415648829] [2024-11-08 18:27:33,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:33,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:27:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:27:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=693, Unknown=31, NotChecked=488, Total=1332 [2024-11-08 18:27:33,883 INFO L87 Difference]: Start difference. First operand 860 states and 1048 transitions. Second operand has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 18:27:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:37,618 INFO L93 Difference]: Finished difference Result 865 states and 1053 transitions. [2024-11-08 18:27:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:27:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 124 [2024-11-08 18:27:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:37,621 INFO L225 Difference]: With dead ends: 865 [2024-11-08 18:27:37,621 INFO L226 Difference]: Without dead ends: 863 [2024-11-08 18:27:37,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=165, Invalid=1093, Unknown=34, NotChecked=600, Total=1892 [2024-11-08 18:27:37,622 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 886 mSDsluCounter, 4262 mSDsCounter, 0 mSdLazyCounter, 3221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:37,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 4587 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3221 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 18:27:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-08 18:27:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2024-11-08 18:27:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 715 states have (on average 1.46013986013986) internal successors, (1044), 857 states have internal predecessors, (1044), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:27:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1051 transitions. [2024-11-08 18:27:37,638 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1051 transitions. Word has length 124 [2024-11-08 18:27:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:37,638 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1051 transitions. [2024-11-08 18:27:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 18:27:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1051 transitions. [2024-11-08 18:27:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:27:37,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:37,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:27:37,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-08 18:27:37,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-08 18:27:37,844 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:27:37,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1039527440, now seen corresponding path program 1 times [2024-11-08 18:27:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868195377] [2024-11-08 18:27:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:27:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:27:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:27:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868195377] [2024-11-08 18:27:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868195377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291637728] [2024-11-08 18:27:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:38,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:38,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:38,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 18:27:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:38,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 18:27:38,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:38,797 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-08 18:27:39,641 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 18:27:39,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 18:27:39,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:27:39,671 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-08 18:27:39,723 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-08 18:27:39,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-08 18:27:40,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:40,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:40,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:40,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:40,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:27:40,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:27:40,662 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-08 18:27:40,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:27:40,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 11 treesize of output 11 [2024-11-08 18:27:40,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,752 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-08 18:27:40,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:40,911 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-08 18:27:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 18:27:41,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:27:41,425 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|#Ultimate.C_memset#1_#ptr.base| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_78| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |#Ultimate.C_memset#1_#ptr.base| (store (select |c_old(#memory_$Pointer$#1.base)| |#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_78| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_78| 0) (<= (+ |c_#Ultimate.C_memset#1_#amount| |c_#Ultimate.C_memset#1_#ptr.offset|) (select |c_#length| |#Ultimate.C_memset#1_#ptr.base|)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20| Int) (v_arrayElimCell_241 Int)) (and (= (select |c_#valid| v_arrayElimCell_241) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20|) 40) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_20| v_arrayElimCell_241))))) is different from true [2024-11-08 18:27:41,528 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-08 18:27:41,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2024-11-08 18:27:41,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:27:41,569 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 3 case distinctions, treesize of input 18 treesize of output 36 [2024-11-08 18:27:42,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:27:42,290 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 67 treesize of output 85 [2024-11-08 18:27:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-08 18:27:42,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291637728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:42,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 26] total 31 [2024-11-08 18:27:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841826202] [2024-11-08 18:27:42,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 18:27:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:42,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 18:27:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1010, Unknown=1, NotChecked=64, Total=1190 [2024-11-08 18:27:42,800 INFO L87 Difference]: Start difference. First operand 863 states and 1051 transitions. Second operand has 31 states, 30 states have (on average 8.0) internal successors, (240), 29 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 18:27:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:51,934 INFO L93 Difference]: Finished difference Result 877 states and 1066 transitions. [2024-11-08 18:27:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 18:27:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 8.0) internal successors, (240), 29 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 126 [2024-11-08 18:27:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:51,936 INFO L225 Difference]: With dead ends: 877 [2024-11-08 18:27:51,936 INFO L226 Difference]: Without dead ends: 871 [2024-11-08 18:27:51,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=269, Invalid=2596, Unknown=1, NotChecked=104, Total=2970 [2024-11-08 18:27:51,937 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 463 mSDsluCounter, 4549 mSDsCounter, 0 mSdLazyCounter, 6142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 6711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:51,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 4801 Invalid, 6711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6142 Invalid, 0 Unknown, 546 Unchecked, 7.9s Time] [2024-11-08 18:27:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-08 18:27:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2024-11-08 18:27:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 721 states have (on average 1.4576976421636616) internal successors, (1051), 862 states have internal predecessors, (1051), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:27:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1058 transitions. [2024-11-08 18:27:51,946 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1058 transitions. Word has length 126 [2024-11-08 18:27:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:51,946 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1058 transitions. [2024-11-08 18:27:51,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 8.0) internal successors, (240), 29 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 18:27:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1058 transitions. [2024-11-08 18:27:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 18:27:51,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:51,948 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:27:51,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 18:27:52,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:52,153 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:27:52,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash -848437498, now seen corresponding path program 2 times [2024-11-08 18:27:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732603321] [2024-11-08 18:27:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 18:27:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 18:27:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:27:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732603321] [2024-11-08 18:27:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732603321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:52,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649009567] [2024-11-08 18:27:52,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:27:52,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:52,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:52,566 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:52,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 18:27:53,010 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 18:27:53,011 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:27:53,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 18:27:53,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:53,046 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-08 18:27:53,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 18:27:53,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:27:53,879 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 54 treesize of output 38 [2024-11-08 18:27:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 18:27:54,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:27:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649009567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:27:54,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2024-11-08 18:27:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433169708] [2024-11-08 18:27:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:27:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:54,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:27:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:27:54,388 INFO L87 Difference]: Start difference. First operand 869 states and 1058 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:27:58,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:28:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:00,711 INFO L93 Difference]: Finished difference Result 1196 states and 1406 transitions. [2024-11-08 18:28:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:28:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-11-08 18:28:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:00,713 INFO L225 Difference]: With dead ends: 1196 [2024-11-08 18:28:00,713 INFO L226 Difference]: Without dead ends: 1196 [2024-11-08 18:28:00,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:28:00,714 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 572 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 4190 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:00,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 4190 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1127 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-08 18:28:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-11-08 18:28:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 869. [2024-11-08 18:28:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 721 states have (on average 1.4563106796116505) internal successors, (1050), 862 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:28:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1057 transitions. [2024-11-08 18:28:00,726 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1057 transitions. Word has length 128 [2024-11-08 18:28:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:00,726 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1057 transitions. [2024-11-08 18:28:00,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:28:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1057 transitions. [2024-11-08 18:28:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:28:00,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:00,727 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:28:00,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:00,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:00,932 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:00,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1396463217, now seen corresponding path program 1 times [2024-11-08 18:28:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337809492] [2024-11-08 18:28:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:28:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 18:28:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 18:28:01,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337809492] [2024-11-08 18:28:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337809492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:28:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521318325] [2024-11-08 18:28:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:01,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:01,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:01,337 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:01,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 18:28:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-08 18:28:01,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:01,850 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-08 18:28:02,229 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 18:28:02,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 18:28:02,244 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:28:02,244 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-08 18:28:02,277 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-08 18:28:02,369 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 10 treesize of output 4 [2024-11-08 18:28:02,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:28:02,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:28:02,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:28:02,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:28:02,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:28:03,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:28:03,007 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-08 18:28:03,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:28:03,019 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-08 18:28:03,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:03,078 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-08 18:28:03,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:03,199 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-08 18:28:03,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:28:17,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:28:17,586 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 23 [2024-11-08 18:28:17,688 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-08 18:28:17,689 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 3 case distinctions, treesize of input 16 treesize of output 26 [2024-11-08 18:28:19,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-08 18:28:19,905 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 18:28:19,906 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 18:28:19,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:20,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:20,107 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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-08 18:28:20,111 INFO L158 Benchmark]: Toolchain (without parser) took 272474.10ms. Allocated memory was 157.3MB in the beginning and 629.1MB in the end (delta: 471.9MB). Free memory was 113.7MB in the beginning and 420.9MB in the end (delta: -307.2MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2024-11-08 18:28:20,111 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 157.3MB. Free memory was 125.6MB in the beginning and 125.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:28:20,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.44ms. Allocated memory is still 157.3MB. Free memory was 113.7MB in the beginning and 83.1MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 18:28:20,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.33ms. Allocated memory is still 157.3MB. Free memory was 83.1MB in the beginning and 77.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:28:20,111 INFO L158 Benchmark]: Boogie Preprocessor took 190.47ms. Allocated memory is still 157.3MB. Free memory was 77.4MB in the beginning and 67.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 18:28:20,111 INFO L158 Benchmark]: RCFGBuilder took 2362.44ms. Allocated memory was 157.3MB in the beginning and 207.6MB in the end (delta: 50.3MB). Free memory was 67.0MB in the beginning and 122.0MB in the end (delta: -55.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-08 18:28:20,112 INFO L158 Benchmark]: TraceAbstraction took 269044.78ms. Allocated memory was 207.6MB in the beginning and 629.1MB in the end (delta: 421.5MB). Free memory was 120.9MB in the beginning and 420.9MB in the end (delta: -300.0MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2024-11-08 18:28:20,112 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.28ms. Allocated memory is still 157.3MB. Free memory was 125.6MB in the beginning and 125.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.44ms. Allocated memory is still 157.3MB. Free memory was 113.7MB in the beginning and 83.1MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.33ms. Allocated memory is still 157.3MB. Free memory was 83.1MB in the beginning and 77.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 190.47ms. Allocated memory is still 157.3MB. Free memory was 77.4MB in the beginning and 67.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2362.44ms. Allocated memory was 157.3MB in the beginning and 207.6MB in the end (delta: 50.3MB). Free memory was 67.0MB in the beginning and 122.0MB in the end (delta: -55.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 269044.78ms. Allocated memory was 207.6MB in the beginning and 629.1MB in the end (delta: 421.5MB). Free memory was 120.9MB in the beginning and 420.9MB in the end (delta: -300.0MB). Peak memory consumption was 122.1MB. 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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) 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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:28:22,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:28:22,350 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 18:28:22,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:28:22,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:28:22,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:28:22,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:28:22,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:28:22,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:28:22,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:28:22,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:28:22,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:28:22,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:28:22,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:28:22,418 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:28:22,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:28:22,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:28:22,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:28:22,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:28:22,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:28:22,420 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:28:22,424 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:28:22,425 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:28:22,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:28:22,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:28:22,426 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:28:22,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:28:22,427 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:28:22,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:28:22,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:28:22,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:28:22,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:28:22,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:28:22,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:28:22,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:28:22,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:28:22,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:28:22,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:28:22,433 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:28:22,433 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:28:22,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:28:22,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:28:22,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:28:22,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:28:22,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/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_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-08 18:28:22,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:28:22,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:28:22,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:28:22,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:28:22,922 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:28:22,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-08 18:28:23,647 INFO L533 CDTParser]: Created temporary CDT project at NULL Unable to find full path for "g++" Unable to find full path for "g++" [2024-11-08 18:28:26,468 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:28:26,468 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-08 18:28:26,496 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data/23eef3a1b/8e69937815a044c2a30ff43d24dcf3c4/FLAG95e1a55be [2024-11-08 18:28:26,648 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/data/23eef3a1b/8e69937815a044c2a30ff43d24dcf3c4 [2024-11-08 18:28:26,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:28:26,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:28:26,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:28:26,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:28:26,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:28:26,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:28:26" (1/1) ... [2024-11-08 18:28:26,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e922b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:26, skipping insertion in model container [2024-11-08 18:28:26,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:28:26" (1/1) ... [2024-11-08 18:28:26,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:28:27,329 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-08 18:28:27,386 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-08 18:28:27,391 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-08 18:28:27,397 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-08 18:28:27,412 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-08 18:28:27,437 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-08 18:28:27,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:28:27,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:28:27,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:28:27,631 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:28:27,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27 WrapperNode [2024-11-08 18:28:27,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:28:27,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:28:27,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:28:27,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:28:27,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,712 INFO L138 Inliner]: procedures = 179, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 577 [2024-11-08 18:28:27,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:28:27,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:28:27,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:28:27,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:28:27,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,786 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-08 18:28:27,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:28:27,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:28:27,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:28:27,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:28:27,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (1/1) ... [2024-11-08 18:28:27,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:28:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:27,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:28:27,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:28:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:28:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:28:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:28:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:28:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 18:28:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 18:28:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 18:28:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 18:28:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:28:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:28:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:28:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:28:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:28:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:28:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:28:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:28:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:28:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:28:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:28:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:28:27,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:28:28,190 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:28:28,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:28:28,198 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:28:28,266 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:28:31,258 INFO L? ?]: Removed 678 outVars from TransFormulas that were not future-live. [2024-11-08 18:28:31,259 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:28:31,286 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:28:31,286 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-08 18:28:31,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:28:31 BoogieIcfgContainer [2024-11-08 18:28:31,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:28:31,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:28:31,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:28:31,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:28:31,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:28:26" (1/3) ... [2024-11-08 18:28:31,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12504546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:28:31, skipping insertion in model container [2024-11-08 18:28:31,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:28:27" (2/3) ... [2024-11-08 18:28:31,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12504546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:28:31, skipping insertion in model container [2024-11-08 18:28:31,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:28:31" (3/3) ... [2024-11-08 18:28:31,299 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2024-11-08 18:28:31,318 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:28:31,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-08 18:28:31,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:28:31,408 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=PETRI_NET, 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;@36fc30ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:28:31,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-08 18:28:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 640 states, 318 states have (on average 2.1949685534591197) internal successors, (698), 635 states have internal predecessors, (698), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:28:31,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:31,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:28:31,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:31,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042701, now seen corresponding path program 1 times [2024-11-08 18:28:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761384361] [2024-11-08 18:28:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:31,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:31,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:28:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:31,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:28:31,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:31,590 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-08 18:28:31,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:31,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761384361] [2024-11-08 18:28:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761384361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:28:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399585456] [2024-11-08 18:28:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:28:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:28:31,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:28:31,644 INFO L87 Difference]: Start difference. First operand has 640 states, 318 states have (on average 2.1949685534591197) internal successors, (698), 635 states have internal predecessors, (698), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:31,708 INFO L93 Difference]: Finished difference Result 630 states and 661 transitions. [2024-11-08 18:28:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:28:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-08 18:28:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:31,732 INFO L225 Difference]: With dead ends: 630 [2024-11-08 18:28:31,733 INFO L226 Difference]: Without dead ends: 628 [2024-11-08 18:28:31,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:28:31,739 INFO L432 NwaCegarLoop]: 661 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, 661 SdHoareTripleChecker+Invalid, 0 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-08 18:28:31,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:28:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-08 18:28:31,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2024-11-08 18:28:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 312 states have (on average 2.092948717948718) internal successors, (653), 623 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 659 transitions. [2024-11-08 18:28:31,833 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 659 transitions. Word has length 6 [2024-11-08 18:28:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:31,834 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 659 transitions. [2024-11-08 18:28:31,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 659 transitions. [2024-11-08 18:28:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:28:31,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:31,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:28:31,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:32,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:32,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:32,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042763, now seen corresponding path program 1 times [2024-11-08 18:28:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563814007] [2024-11-08 18:28:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:32,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:32,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:32,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:32,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:28:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:32,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:28:32,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:32,203 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-08 18:28:32,221 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-08 18:28:32,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:32,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563814007] [2024-11-08 18:28:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563814007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:32,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:28:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61270578] [2024-11-08 18:28:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:32,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:28:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:28:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:28:32,226 INFO L87 Difference]: Start difference. First operand 628 states and 659 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:33,638 INFO L93 Difference]: Finished difference Result 582 states and 615 transitions. [2024-11-08 18:28:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:28:33,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-08 18:28:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:33,641 INFO L225 Difference]: With dead ends: 582 [2024-11-08 18:28:33,642 INFO L226 Difference]: Without dead ends: 582 [2024-11-08 18:28:33,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 18:28:33,643 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 522 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:33,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 316 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 18:28:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-08 18:28:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2024-11-08 18:28:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 312 states have (on average 1.935897435897436) internal successors, (604), 574 states have internal predecessors, (604), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 610 transitions. [2024-11-08 18:28:33,662 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 610 transitions. Word has length 6 [2024-11-08 18:28:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:33,663 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 610 transitions. [2024-11-08 18:28:33,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 610 transitions. [2024-11-08 18:28:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 18:28:33,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:33,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:28:33,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:33,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:33,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042764, now seen corresponding path program 1 times [2024-11-08 18:28:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771758181] [2024-11-08 18:28:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:33,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:33,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:33,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:33,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:28:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:33,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:28:33,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:33,984 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-08 18:28:34,012 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-08 18:28:34,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:34,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:34,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771758181] [2024-11-08 18:28:34,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771758181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:34,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:34,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:28:34,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495730881] [2024-11-08 18:28:34,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:34,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:28:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:28:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:28:34,015 INFO L87 Difference]: Start difference. First operand 579 states and 610 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:35,508 INFO L93 Difference]: Finished difference Result 654 states and 690 transitions. [2024-11-08 18:28:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:28:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-08 18:28:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:35,511 INFO L225 Difference]: With dead ends: 654 [2024-11-08 18:28:35,511 INFO L226 Difference]: Without dead ends: 654 [2024-11-08 18:28:35,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 18:28:35,513 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 271 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:35,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 662 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 18:28:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-08 18:28:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 605. [2024-11-08 18:28:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 349 states have (on average 1.9111747851002865) internal successors, (667), 600 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 673 transitions. [2024-11-08 18:28:35,530 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 673 transitions. Word has length 6 [2024-11-08 18:28:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:35,530 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 673 transitions. [2024-11-08 18:28:35,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 673 transitions. [2024-11-08 18:28:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 18:28:35,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:35,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:35,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:28:35,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:35,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:35,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1969530631, now seen corresponding path program 1 times [2024-11-08 18:28:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403753804] [2024-11-08 18:28:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:35,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:35,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:35,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:28:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:28:35,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:35,887 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-08 18:28:35,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:35,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:35,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403753804] [2024-11-08 18:28:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403753804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:35,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:35,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:35,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217666966] [2024-11-08 18:28:35,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:35,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:35,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:35,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:35,894 INFO L87 Difference]: Start difference. First operand 605 states and 673 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-08 18:28:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:36,476 INFO L93 Difference]: Finished difference Result 739 states and 822 transitions. [2024-11-08 18:28:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:28:36,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-08 18:28:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:36,480 INFO L225 Difference]: With dead ends: 739 [2024-11-08 18:28:36,480 INFO L226 Difference]: Without dead ends: 739 [2024-11-08 18:28:36,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:36,481 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 145 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:36,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1653 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:28:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-08 18:28:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 693. [2024-11-08 18:28:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 437 states have (on average 1.8672768878718535) internal successors, (816), 688 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 822 transitions. [2024-11-08 18:28:36,499 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 822 transitions. Word has length 7 [2024-11-08 18:28:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:36,499 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 822 transitions. [2024-11-08 18:28:36,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-08 18:28:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 822 transitions. [2024-11-08 18:28:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 18:28:36,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:36,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:36,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:28:36,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:36,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr319ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:36,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1347377724, now seen corresponding path program 1 times [2024-11-08 18:28:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:36,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918106538] [2024-11-08 18:28:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:36,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:36,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:36,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:36,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:28:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:36,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:28:36,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:36,839 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-08 18:28:36,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:36,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918106538] [2024-11-08 18:28:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918106538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:36,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:36,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:28:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395037979] [2024-11-08 18:28:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:28:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:36,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:28:36,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:28:36,843 INFO L87 Difference]: Start difference. First operand 693 states and 822 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-08 18:28:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:37,690 INFO L93 Difference]: Finished difference Result 700 states and 828 transitions. [2024-11-08 18:28:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:28:37,691 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-08 18:28:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:37,693 INFO L225 Difference]: With dead ends: 700 [2024-11-08 18:28:37,694 INFO L226 Difference]: Without dead ends: 698 [2024-11-08 18:28:37,694 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-08 18:28:37,695 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 5 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:37,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 929 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:28:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-08 18:28:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 695. [2024-11-08 18:28:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 439 states have (on average 1.8633257403189065) internal successors, (818), 690 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 824 transitions. [2024-11-08 18:28:37,714 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 824 transitions. Word has length 9 [2024-11-08 18:28:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 824 transitions. [2024-11-08 18:28:37,714 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-08 18:28:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 824 transitions. [2024-11-08 18:28:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 18:28:37,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:37,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:37,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:37,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr318ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1347388552, now seen corresponding path program 1 times [2024-11-08 18:28:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412181103] [2024-11-08 18:28:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:37,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:37,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:37,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:37,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:28:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:38,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:28:38,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:38,050 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-08 18:28:38,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:38,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412181103] [2024-11-08 18:28:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412181103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:38,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:38,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:38,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352991044] [2024-11-08 18:28:38,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:38,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:38,054 INFO L87 Difference]: Start difference. First operand 695 states and 824 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-08 18:28:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:38,088 INFO L93 Difference]: Finished difference Result 695 states and 823 transitions. [2024-11-08 18:28:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:28:38,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-08 18:28:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:38,091 INFO L225 Difference]: With dead ends: 695 [2024-11-08 18:28:38,091 INFO L226 Difference]: Without dead ends: 691 [2024-11-08 18:28:38,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:38,093 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 9 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:38,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1786 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:28:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-08 18:28:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-11-08 18:28:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 435 states have (on average 1.8666666666666667) internal successors, (812), 686 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 818 transitions. [2024-11-08 18:28:38,135 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 818 transitions. Word has length 9 [2024-11-08 18:28:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:38,136 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 818 transitions. [2024-11-08 18:28:38,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-08 18:28:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 818 transitions. [2024-11-08 18:28:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:28:38,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:38,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:38,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 18:28:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:38,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082515, now seen corresponding path program 1 times [2024-11-08 18:28:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:38,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946307830] [2024-11-08 18:28:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:38,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:38,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:38,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:38,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:28:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:38,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:28:38,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:38,475 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-08 18:28:38,554 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-08 18:28:38,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:38,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:38,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946307830] [2024-11-08 18:28:38,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946307830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:38,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:38,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:28:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902588721] [2024-11-08 18:28:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:38,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:38,559 INFO L87 Difference]: Start difference. First operand 691 states and 818 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 18:28:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:40,797 INFO L93 Difference]: Finished difference Result 676 states and 780 transitions. [2024-11-08 18:28:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:28:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 18:28:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:40,801 INFO L225 Difference]: With dead ends: 676 [2024-11-08 18:28:40,801 INFO L226 Difference]: Without dead ends: 676 [2024-11-08 18:28:40,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-08 18:28:40,803 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 570 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:40,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 495 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:28:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-08 18:28:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 668. [2024-11-08 18:28:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 435 states have (on average 1.760919540229885) internal successors, (766), 663 states have internal predecessors, (766), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 772 transitions. [2024-11-08 18:28:40,828 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 772 transitions. Word has length 17 [2024-11-08 18:28:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:40,829 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 772 transitions. [2024-11-08 18:28:40,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 18:28:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 772 transitions. [2024-11-08 18:28:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 18:28:40,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:40,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:40,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:41,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:41,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:41,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082514, now seen corresponding path program 1 times [2024-11-08 18:28:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492377135] [2024-11-08 18:28:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:41,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:41,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:41,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:28:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:28:41,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:41,182 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-08 18:28:41,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:41,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492377135] [2024-11-08 18:28:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492377135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:28:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872497107] [2024-11-08 18:28:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:28:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:28:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:28:41,186 INFO L87 Difference]: Start difference. First operand 668 states and 772 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-08 18:28:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:41,227 INFO L93 Difference]: Finished difference Result 618 states and 706 transitions. [2024-11-08 18:28:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:28:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-08 18:28:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:41,231 INFO L225 Difference]: With dead ends: 618 [2024-11-08 18:28:41,231 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 18:28:41,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-08 18:28:41,232 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 61 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:41,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1009 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:28:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 18:28:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-08 18:28:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 397 states have (on average 1.7632241813602014) internal successors, (700), 613 states have internal predecessors, (700), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 706 transitions. [2024-11-08 18:28:41,251 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 706 transitions. Word has length 17 [2024-11-08 18:28:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:41,251 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 706 transitions. [2024-11-08 18:28:41,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 706 transitions. [2024-11-08 18:28:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 18:28:41,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:41,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:41,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 18:28:41,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:41,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:41,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1141265928, now seen corresponding path program 1 times [2024-11-08 18:28:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:41,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969464599] [2024-11-08 18:28:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:41,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:41,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:28:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:28:41,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:41,600 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-08 18:28:41,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:41,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:41,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969464599] [2024-11-08 18:28:41,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969464599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:41,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:41,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:41,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806055772] [2024-11-08 18:28:41,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:41,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:41,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:41,605 INFO L87 Difference]: Start difference. First operand 618 states and 706 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:41,729 INFO L93 Difference]: Finished difference Result 595 states and 662 transitions. [2024-11-08 18:28:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:28:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 18:28:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:41,732 INFO L225 Difference]: With dead ends: 595 [2024-11-08 18:28:41,732 INFO L226 Difference]: Without dead ends: 595 [2024-11-08 18:28:41,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-08 18:28:41,734 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 45 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:41,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1456 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:28:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-08 18:28:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2024-11-08 18:28:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 381 states have (on average 1.7217847769028871) internal successors, (656), 590 states have internal predecessors, (656), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 662 transitions. [2024-11-08 18:28:41,752 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 662 transitions. Word has length 18 [2024-11-08 18:28:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:41,753 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 662 transitions. [2024-11-08 18:28:41,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 662 transitions. [2024-11-08 18:28:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 18:28:41,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:41,754 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-08 18:28:41,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:41,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:41,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:41,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2023947366, now seen corresponding path program 1 times [2024-11-08 18:28:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251146765] [2024-11-08 18:28:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:41,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:41,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:41,962 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:41,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:28:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:42,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:28:42,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:42,117 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-08 18:28:42,462 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-08 18:28:42,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:42,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:42,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251146765] [2024-11-08 18:28:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251146765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:42,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:28:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187814369] [2024-11-08 18:28:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:42,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:42,465 INFO L87 Difference]: Start difference. First operand 595 states and 662 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-08 18:28:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:44,707 INFO L93 Difference]: Finished difference Result 648 states and 679 transitions. [2024-11-08 18:28:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:28:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-08 18:28:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:44,711 INFO L225 Difference]: With dead ends: 648 [2024-11-08 18:28:44,711 INFO L226 Difference]: Without dead ends: 648 [2024-11-08 18:28:44,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-08 18:28:44,712 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 198 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:44,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 968 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:28:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-08 18:28:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 591. [2024-11-08 18:28:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 381 states have (on average 1.7007874015748032) internal successors, (648), 586 states have internal predecessors, (648), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 654 transitions. [2024-11-08 18:28:44,729 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 654 transitions. Word has length 32 [2024-11-08 18:28:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 654 transitions. [2024-11-08 18:28:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-08 18:28:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 654 transitions. [2024-11-08 18:28:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 18:28:44,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:44,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:44,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 18:28:44,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:44,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:44,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash -577675290, now seen corresponding path program 1 times [2024-11-08 18:28:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609004220] [2024-11-08 18:28:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:44,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:44,936 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:44,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:28:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:45,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:28:45,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:45,239 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-08 18:28:45,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:45,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609004220] [2024-11-08 18:28:45,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609004220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:45,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:45,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461776441] [2024-11-08 18:28:45,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:45,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:45,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:45,242 INFO L87 Difference]: Start difference. First operand 591 states and 654 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:45,340 INFO L93 Difference]: Finished difference Result 579 states and 634 transitions. [2024-11-08 18:28:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:28:45,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-08 18:28:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:45,343 INFO L225 Difference]: With dead ends: 579 [2024-11-08 18:28:45,343 INFO L226 Difference]: Without dead ends: 579 [2024-11-08 18:28:45,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-08 18:28:45,345 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 21 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:45,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1442 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:28:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-08 18:28:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-11-08 18:28:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 369 states have (on average 1.7018970189701896) internal successors, (628), 574 states have internal predecessors, (628), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 634 transitions. [2024-11-08 18:28:45,361 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 634 transitions. Word has length 51 [2024-11-08 18:28:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 634 transitions. [2024-11-08 18:28:45,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 634 transitions. [2024-11-08 18:28:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 18:28:45,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:45,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:45,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:45,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:45,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:45,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1173253914, now seen corresponding path program 1 times [2024-11-08 18:28:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366295490] [2024-11-08 18:28:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:45,568 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:45,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 18:28:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:45,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 18:28:45,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:45,771 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-08 18:28:46,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:28:46,488 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-08 18:28:46,511 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:28:46,512 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-08 18:28:46,521 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-08 18:28:46,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:46,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366295490] [2024-11-08 18:28:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366295490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:46,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745986506] [2024-11-08 18:28:46,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:46,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:28:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:28:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:28:46,523 INFO L87 Difference]: Start difference. First operand 579 states and 634 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:48,737 INFO L93 Difference]: Finished difference Result 541 states and 596 transitions. [2024-11-08 18:28:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:28:48,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-08 18:28:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:48,740 INFO L225 Difference]: With dead ends: 541 [2024-11-08 18:28:48,740 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 18:28:48,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:28:48,741 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 417 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:48,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 313 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:28:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 18:28:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 504. [2024-11-08 18:28:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 332 states have (on average 1.5542168674698795) internal successors, (516), 499 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 522 transitions. [2024-11-08 18:28:48,753 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 522 transitions. Word has length 59 [2024-11-08 18:28:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 522 transitions. [2024-11-08 18:28:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 522 transitions. [2024-11-08 18:28:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 18:28:48,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:48,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:48,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 18:28:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:48,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:48,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash -493315492, now seen corresponding path program 1 times [2024-11-08 18:28:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075499776] [2024-11-08 18:28:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:48,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:48,959 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:48,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 18:28:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:49,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:28:49,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:49,188 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-08 18:28:49,215 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-08 18:28:49,252 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-08 18:28:49,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-08 18:28:49,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:49,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075499776] [2024-11-08 18:28:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075499776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059181618] [2024-11-08 18:28:49,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:49,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:28:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:28:49,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:28:49,272 INFO L87 Difference]: Start difference. First operand 504 states and 522 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:51,087 INFO L93 Difference]: Finished difference Result 503 states and 521 transitions. [2024-11-08 18:28:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:28:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-08 18:28:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:51,090 INFO L225 Difference]: With dead ends: 503 [2024-11-08 18:28:51,090 INFO L226 Difference]: Without dead ends: 503 [2024-11-08 18:28:51,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 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-08 18:28:51,091 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:51,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1168 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:28:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-08 18:28:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2024-11-08 18:28:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 332 states have (on average 1.5512048192771084) internal successors, (515), 498 states have internal predecessors, (515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 521 transitions. [2024-11-08 18:28:51,101 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 521 transitions. Word has length 64 [2024-11-08 18:28:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:51,102 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 521 transitions. [2024-11-08 18:28:51,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 521 transitions. [2024-11-08 18:28:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 18:28:51,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:51,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:51,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 18:28:51,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:51,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:51,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -493315491, now seen corresponding path program 1 times [2024-11-08 18:28:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75095498] [2024-11-08 18:28:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:51,308 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:51,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 18:28:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:51,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 18:28:51,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:51,530 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-08 18:28:51,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 18:28:51,571 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-08 18:28:51,638 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-08 18:28:51,664 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-08 18:28:51,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:51,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:51,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75095498] [2024-11-08 18:28:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75095498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929039073] [2024-11-08 18:28:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:51,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:28:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:28:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:28:51,666 INFO L87 Difference]: Start difference. First operand 503 states and 521 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:53,825 INFO L93 Difference]: Finished difference Result 502 states and 520 transitions. [2024-11-08 18:28:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:28:53,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-08 18:28:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:53,829 INFO L225 Difference]: With dead ends: 502 [2024-11-08 18:28:53,829 INFO L226 Difference]: Without dead ends: 502 [2024-11-08 18:28:53,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 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-08 18:28:53,830 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 1 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:53,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1177 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 18:28:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-08 18:28:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-11-08 18:28:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 331 states have (on average 1.552870090634441) internal successors, (514), 497 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:28:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 520 transitions. [2024-11-08 18:28:53,842 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 520 transitions. Word has length 64 [2024-11-08 18:28:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:53,842 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 520 transitions. [2024-11-08 18:28:53,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:28:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 520 transitions. [2024-11-08 18:28:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 18:28:53,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:53,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:53,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 18:28:54,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:54,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:54,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1301506173, now seen corresponding path program 1 times [2024-11-08 18:28:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:54,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415547985] [2024-11-08 18:28:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:54,048 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:54,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 18:28:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:54,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 18:28:54,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:54,286 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-08 18:28:54,389 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-08 18:28:54,414 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-08 18:28:54,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:54,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415547985] [2024-11-08 18:28:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415547985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:28:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316770857] [2024-11-08 18:28:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:28:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:28:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:28:54,418 INFO L87 Difference]: Start difference. First operand 502 states and 520 transitions. Second operand has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:28:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:57,166 INFO L93 Difference]: Finished difference Result 514 states and 535 transitions. [2024-11-08 18:28:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:28:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-08 18:28:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:57,169 INFO L225 Difference]: With dead ends: 514 [2024-11-08 18:28:57,170 INFO L226 Difference]: Without dead ends: 514 [2024-11-08 18:28:57,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:28:57,171 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 6 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:57,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1849 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 18:28:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-08 18:28:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 508. [2024-11-08 18:28:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 336 states have (on average 1.5505952380952381) internal successors, (521), 502 states have internal predecessors, (521), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:28:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 530 transitions. [2024-11-08 18:28:57,184 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 530 transitions. Word has length 72 [2024-11-08 18:28:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:57,185 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 530 transitions. [2024-11-08 18:28:57,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:28:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 530 transitions. [2024-11-08 18:28:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 18:28:57,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:57,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:57,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 18:28:57,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:57,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:57,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1301506172, now seen corresponding path program 1 times [2024-11-08 18:28:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760621117] [2024-11-08 18:28:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:57,390 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:57,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 18:28:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:28:57,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:57,676 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-08 18:28:57,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:28:57,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760621117] [2024-11-08 18:28:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760621117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:57,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:28:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413114450] [2024-11-08 18:28:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:57,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:28:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:28:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:57,680 INFO L87 Difference]: Start difference. First operand 508 states and 530 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:28:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:57,744 INFO L93 Difference]: Finished difference Result 505 states and 524 transitions. [2024-11-08 18:28:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:28:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-08 18:28:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:57,748 INFO L225 Difference]: With dead ends: 505 [2024-11-08 18:28:57,748 INFO L226 Difference]: Without dead ends: 505 [2024-11-08 18:28:57,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:28:57,749 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:57,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1387 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:28:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-08 18:28:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2024-11-08 18:28:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 333 states have (on average 1.5525525525525525) internal successors, (517), 500 states have internal predecessors, (517), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:28:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 524 transitions. [2024-11-08 18:28:57,762 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 524 transitions. Word has length 72 [2024-11-08 18:28:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:57,763 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 524 transitions. [2024-11-08 18:28:57,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:28:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 524 transitions. [2024-11-08 18:28:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 18:28:57,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:57,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:28:57,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-08 18:28:57,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:57,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -47137158, now seen corresponding path program 1 times [2024-11-08 18:28:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316930780] [2024-11-08 18:28:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:57,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:57,967 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:57,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 18:28:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:58,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:28:58,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:28:58,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:28:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:28:58,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:28:58,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316930780] [2024-11-08 18:28:58,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316930780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:28:58,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:28:58,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 18:28:58,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759143530] [2024-11-08 18:28:58,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:28:58,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:28:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:28:58,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:28:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:28:58,397 INFO L87 Difference]: Start difference. First operand 505 states and 524 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:28:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:58,629 INFO L93 Difference]: Finished difference Result 517 states and 541 transitions. [2024-11-08 18:28:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:28:58,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-11-08 18:28:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:58,632 INFO L225 Difference]: With dead ends: 517 [2024-11-08 18:28:58,633 INFO L226 Difference]: Without dead ends: 517 [2024-11-08 18:28:58,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:28:58,636 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 7 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:58,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1389 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:28:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-08 18:28:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2024-11-08 18:28:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 342 states have (on average 1.5555555555555556) internal successors, (532), 509 states have internal predecessors, (532), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:28:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 539 transitions. [2024-11-08 18:28:58,651 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 539 transitions. Word has length 73 [2024-11-08 18:28:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 539 transitions. [2024-11-08 18:28:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:28:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 539 transitions. [2024-11-08 18:28:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 18:28:58,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:58,653 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:28:58,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 18:28:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:58,853 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:28:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1438260547, now seen corresponding path program 2 times [2024-11-08 18:28:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:28:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469223516] [2024-11-08 18:28:58,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:28:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:58,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:58,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 18:29:07,815 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:29:07,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:29:07,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 18:29:07,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:29:07,989 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:29:07,989 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-08 18:29:08,017 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-08 18:29:08,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:08,253 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-08 18:29:08,322 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-08 18:29:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 18:29:08,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:29:08,471 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-08 18:29:08,472 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 25 treesize of output 24 [2024-11-08 18:29:08,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-08 18:29:08,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:29:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469223516] [2024-11-08 18:29:08,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469223516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:29:08,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2147085429] [2024-11-08 18:29:08,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:29:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:29:08,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:29:08,492 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:29:08,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-08 18:29:09,098 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:29:09,098 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:29:09,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:29:09,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:29:09,307 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-08 18:29:09,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:29:09,694 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-08 18:29:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2147085429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:29:09,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:29:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-08 18:29:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093838722] [2024-11-08 18:29:09,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:29:09,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 18:29:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:29:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 18:29:09,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-08 18:29:09,697 INFO L87 Difference]: Start difference. First operand 515 states and 539 transitions. Second operand has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:29:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:20,468 INFO L93 Difference]: Finished difference Result 531 states and 562 transitions. [2024-11-08 18:29:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 18:29:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 76 [2024-11-08 18:29:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:20,472 INFO L225 Difference]: With dead ends: 531 [2024-11-08 18:29:20,472 INFO L226 Difference]: Without dead ends: 527 [2024-11-08 18:29:20,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=413, Invalid=2242, Unknown=1, NotChecked=100, Total=2756 [2024-11-08 18:29:20,474 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 429 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 4003 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:20,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 3737 Invalid, 4023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4003 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-08 18:29:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-08 18:29:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2024-11-08 18:29:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 351 states have (on average 1.547008547008547) internal successors, (543), 517 states have internal predecessors, (543), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:29:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 550 transitions. [2024-11-08 18:29:20,489 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 550 transitions. Word has length 76 [2024-11-08 18:29:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:20,490 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 550 transitions. [2024-11-08 18:29:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:29:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 550 transitions. [2024-11-08 18:29:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 18:29:20,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:20,492 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:29:20,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-08 18:29:20,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-08 18:29:20,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:29:20,893 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:29:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1879653916, now seen corresponding path program 1 times [2024-11-08 18:29:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:29:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800219213] [2024-11-08 18:29:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:29:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:29:20,895 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:29:20,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 18:29:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:21,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 18:29:21,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:29:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:29:21,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:29:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:29:22,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:29:22,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800219213] [2024-11-08 18:29:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800219213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:29:22,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:29:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-08 18:29:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891970323] [2024-11-08 18:29:22,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:29:22,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 18:29:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:29:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 18:29:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-08 18:29:22,430 INFO L87 Difference]: Start difference. First operand 523 states and 550 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:29:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:26,128 INFO L93 Difference]: Finished difference Result 547 states and 589 transitions. [2024-11-08 18:29:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 18:29:26,129 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-08 18:29:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:26,131 INFO L225 Difference]: With dead ends: 547 [2024-11-08 18:29:26,131 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 18:29:26,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 18:29:26,132 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 18 mSDsluCounter, 6446 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6910 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:26,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6910 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:29:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 18:29:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-08 18:29:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 369 states have (on average 1.5338753387533874) internal successors, (566), 535 states have internal predecessors, (566), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:29:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 573 transitions. [2024-11-08 18:29:26,146 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 573 transitions. Word has length 82 [2024-11-08 18:29:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 573 transitions. [2024-11-08 18:29:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 18:29:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 573 transitions. [2024-11-08 18:29:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:29:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:26,148 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:29:26,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-08 18:29:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:29:26,349 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:29:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2102928164, now seen corresponding path program 2 times [2024-11-08 18:29:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:29:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817037238] [2024-11-08 18:29:26,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:29:26,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:29:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:29:26,352 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:29:26,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-08 18:29:31,769 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:29:31,770 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:29:31,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 18:29:31,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:29:31,942 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-08 18:29:31,961 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:29:31,962 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-08 18:29:32,011 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-08 18:29:32,022 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-08 18:29:32,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:29:32,161 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-08 18:29:32,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:32,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 18:29:32,881 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-08 18:29:32,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:29:32,955 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-08 18:29:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 18:29:32,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:29:33,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_990 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_991 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:29:33,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:29:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817037238] [2024-11-08 18:29:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817037238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:29:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [111909996] [2024-11-08 18:29:33,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:29:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:29:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:29:33,720 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:29:33,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-08 18:29:34,710 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:29:34,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:29:34,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 18:29:34,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:29:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:29:35,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:29:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:29:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [111909996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:29:38,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:29:38,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-08 18:29:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150283536] [2024-11-08 18:29:38,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:29:38,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-08 18:29:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:29:38,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-08 18:29:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-08 18:29:38,622 INFO L87 Difference]: Start difference. First operand 541 states and 573 transitions. Second operand has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:30:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:14,247 INFO L93 Difference]: Finished difference Result 584 states and 646 transitions. [2024-11-08 18:30:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-08 18:30:14,248 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 94 [2024-11-08 18:30:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:14,250 INFO L225 Difference]: With dead ends: 584 [2024-11-08 18:30:14,251 INFO L226 Difference]: Without dead ends: 576 [2024-11-08 18:30:14,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=3106, Invalid=14987, Unknown=1, NotChecked=266, Total=18360 [2024-11-08 18:30:14,255 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 462 mSDsluCounter, 6314 mSDsCounter, 0 mSdLazyCounter, 9244 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 6556 SdHoareTripleChecker+Invalid, 9320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 9244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:14,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 6556 Invalid, 9320 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 9244 Invalid, 0 Unknown, 0 Unchecked, 26.2s Time] [2024-11-08 18:30:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-08 18:30:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2024-11-08 18:30:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 403 states have (on average 1.5062034739454093) internal successors, (607), 568 states have internal predecessors, (607), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:30:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 614 transitions. [2024-11-08 18:30:14,267 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 614 transitions. Word has length 94 [2024-11-08 18:30:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:14,267 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 614 transitions. [2024-11-08 18:30:14,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:30:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 614 transitions. [2024-11-08 18:30:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 18:30:14,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:14,269 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:30:14,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-08 18:30:14,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-08 18:30:14,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:30:14,670 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:30:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1594888065, now seen corresponding path program 1 times [2024-11-08 18:30:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:30:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55053109] [2024-11-08 18:30:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:14,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:30:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:30:14,672 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:30:14,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-08 18:30:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:15,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 18:30:15,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:30:15,236 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:30:15,236 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-08 18:30:15,256 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-08 18:30:15,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:15,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 44 treesize of output 43 [2024-11-08 18:30:16,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:16,115 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-08 18:30:16,135 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-08 18:30:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:30:16,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:30:16,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1544) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:30:16,720 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-08 18:30:16,720 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 37 treesize of output 36 [2024-11-08 18:30:16,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 18:30:16,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:30:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55053109] [2024-11-08 18:30:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55053109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793483314] [2024-11-08 18:30:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:16,738 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:30:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:30:16,741 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:30:16,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-08 18:30:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 18:30:19,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:30:19,312 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 18:30:19,313 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-08 18:30:19,732 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 18:30:19,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 18:30:19,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:30:20,068 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 34 treesize of output 16 [2024-11-08 18:30:21,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:21,828 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 54 treesize of output 51 [2024-11-08 18:30:22,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:22,134 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 54 treesize of output 51 [2024-11-08 18:30:22,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-08 18:30:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:30:22,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:30:22,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2007))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [793483314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:22,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:30:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2024-11-08 18:30:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761158758] [2024-11-08 18:30:22,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:30:22,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:30:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:30:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:30:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=458, Unknown=11, NotChecked=138, Total=702 [2024-11-08 18:30:22,827 INFO L87 Difference]: Start difference. First operand 574 states and 614 transitions. Second operand has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:30:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:32,409 INFO L93 Difference]: Finished difference Result 1041 states and 1119 transitions. [2024-11-08 18:30:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 18:30:32,409 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2024-11-08 18:30:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:32,413 INFO L225 Difference]: With dead ends: 1041 [2024-11-08 18:30:32,413 INFO L226 Difference]: Without dead ends: 1041 [2024-11-08 18:30:32,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=215, Invalid=1263, Unknown=16, NotChecked=228, Total=1722 [2024-11-08 18:30:32,414 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 769 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:32,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3574 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-08 18:30:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-08 18:30:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 573. [2024-11-08 18:30:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 403 states have (on average 1.5037220843672456) internal successors, (606), 567 states have internal predecessors, (606), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:30:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 613 transitions. [2024-11-08 18:30:32,430 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 613 transitions. Word has length 119 [2024-11-08 18:30:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 613 transitions. [2024-11-08 18:30:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:30:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 613 transitions. [2024-11-08 18:30:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 18:30:32,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:32,433 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:30:32,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-08 18:30:32,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-08 18:30:32,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:30:32,838 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:30:32,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:32,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1594888066, now seen corresponding path program 1 times [2024-11-08 18:30:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:30:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364088113] [2024-11-08 18:30:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:32,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:30:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:30:32,840 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:30:32,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-08 18:30:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:33,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-08 18:30:33,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:30:33,459 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-08 18:30:33,480 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:30:33,481 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-08 18:30:33,519 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-08 18:30:33,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 13 treesize of output 9 [2024-11-08 18:30:33,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:30:33,690 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-08 18:30:34,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:34,567 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-08 18:30:34,583 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-08 18:30:34,746 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:34,746 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-08 18:30:34,758 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-08 18:30:34,793 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-08 18:30:34,802 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-08 18:30:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:30:34,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:30:35,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:35,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-08 18:30:36,600 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2515))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) .cse0 v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-08 18:30:36,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:30:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364088113] [2024-11-08 18:30:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364088113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2015881168] [2024-11-08 18:30:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:30:36,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:30:36,616 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:30:36,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-08 18:30:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:39,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-08 18:30:39,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:30:39,188 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-08 18:30:39,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:30:39,310 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-08 18:30:39,317 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-08 18:30:39,330 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-08 18:30:39,337 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-08 18:30:39,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:30:39,408 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-08 18:30:40,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:40,143 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-08 18:30:40,154 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-08 18:30:40,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:40,238 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-08 18:30:40,247 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-08 18:30:40,275 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-08 18:30:40,287 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-08 18:30:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:30:40,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:30:40,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:40,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-08 18:30:41,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3024) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3023))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3024) .cse2 v_ArrVal_2931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 18:30:41,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2015881168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:41,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:30:41,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-08 18:30:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106014320] [2024-11-08 18:30:41,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:30:41,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:30:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:30:41,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:30:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=132, Unknown=6, NotChecked=162, Total=342 [2024-11-08 18:30:41,804 INFO L87 Difference]: Start difference. First operand 573 states and 613 transitions. Second operand has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:30:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:47,687 INFO L93 Difference]: Finished difference Result 572 states and 612 transitions. [2024-11-08 18:30:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:30:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2024-11-08 18:30:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:47,690 INFO L225 Difference]: With dead ends: 572 [2024-11-08 18:30:47,690 INFO L226 Difference]: Without dead ends: 572 [2024-11-08 18:30:47,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=283, Unknown=6, NotChecked=234, Total=600 [2024-11-08 18:30:47,691 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 385 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:47,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1357 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-08 18:30:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-08 18:30:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2024-11-08 18:30:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 403 states have (on average 1.501240694789082) internal successors, (605), 566 states have internal predecessors, (605), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:30:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 612 transitions. [2024-11-08 18:30:47,703 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 612 transitions. Word has length 119 [2024-11-08 18:30:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:47,704 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 612 transitions. [2024-11-08 18:30:47,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:30:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 612 transitions. [2024-11-08 18:30:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 18:30:47,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:47,705 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:30:47,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-08 18:30:47,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-08 18:30:48,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:30:48,106 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:30:48,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1912557270, now seen corresponding path program 1 times [2024-11-08 18:30:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:30:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123112515] [2024-11-08 18:30:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:48,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:30:48,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:30:48,109 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:30:48,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-08 18:30:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:48,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 18:30:48,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:30:48,807 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:30:48,808 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-08 18:30:48,830 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-08 18:30:49,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:49,450 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-08 18:30:49,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:49,553 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-08 18:30:49,625 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:49,625 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-08 18:30:49,643 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-08 18:30:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:30:49,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:30:49,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3400) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:30:49,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3399))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:49,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3399))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-08 18:30:50,272 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-08 18:30:50,272 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 60 [2024-11-08 18:30:50,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3399 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3446))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3399)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 18:30:50,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:30:50,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123112515] [2024-11-08 18:30:50,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123112515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:50,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1803006103] [2024-11-08 18:30:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:50,288 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:30:50,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:30:50,291 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:30:50,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-08 18:30:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:55,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-08 18:30:55,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:30:55,205 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 18:30:55,206 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-08 18:30:55,581 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 18:30:55,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 18:30:55,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:30:55,902 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 34 treesize of output 16 [2024-11-08 18:30:57,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:57,310 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 54 treesize of output 51 [2024-11-08 18:30:57,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:57,501 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 54 treesize of output 51 [2024-11-08 18:30:57,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:30:57,637 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 54 treesize of output 51 [2024-11-08 18:30:57,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-08 18:30:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:30:57,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:30:57,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3823))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:57,836 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3823))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:58,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3870))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3823)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:30:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1803006103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:58,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:30:58,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 23 [2024-11-08 18:30:58,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233321124] [2024-11-08 18:30:58,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:30:58,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 18:30:58,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:30:58,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 18:30:58,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=546, Unknown=14, NotChecked=378, Total=1056 [2024-11-08 18:30:58,244 INFO L87 Difference]: Start difference. First operand 572 states and 612 transitions. Second operand has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:31:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:07,187 INFO L93 Difference]: Finished difference Result 1037 states and 1115 transitions. [2024-11-08 18:31:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 18:31:07,188 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-08 18:31:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:07,191 INFO L225 Difference]: With dead ends: 1037 [2024-11-08 18:31:07,191 INFO L226 Difference]: Without dead ends: 1037 [2024-11-08 18:31:07,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=250, Invalid=1481, Unknown=19, NotChecked=602, Total=2352 [2024-11-08 18:31:07,192 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1371 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:07,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 3317 Invalid, 3553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-08 18:31:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-08 18:31:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 571. [2024-11-08 18:31:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 403 states have (on average 1.498759305210918) internal successors, (604), 565 states have internal predecessors, (604), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:31:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 611 transitions. [2024-11-08 18:31:07,209 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 611 transitions. Word has length 122 [2024-11-08 18:31:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:07,210 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 611 transitions. [2024-11-08 18:31:07,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:31:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 611 transitions. [2024-11-08 18:31:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 18:31:07,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:07,212 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:31:07,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-08 18:31:07,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-08 18:31:07,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:31:07,613 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:31:07,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1912557269, now seen corresponding path program 1 times [2024-11-08 18:31:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:31:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148632779] [2024-11-08 18:31:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:31:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:31:07,616 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:31:07,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-08 18:31:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:08,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-08 18:31:08,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:31:08,384 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-08 18:31:08,405 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:31:08,406 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-08 18:31:08,450 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-08 18:31:08,462 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-08 18:31:08,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 22 treesize of output 10 [2024-11-08 18:31:08,650 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-08 18:31:09,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:09,628 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-08 18:31:09,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:31:09,814 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:09,814 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-08 18:31:09,825 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-08 18:31:09,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:09,995 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-08 18:31:10,006 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-08 18:31:10,042 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-08 18:31:10,051 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-08 18:31:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:31:10,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:31:10,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-08 18:31:10,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4291))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4292) .cse0 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4292) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-08 18:31:10,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4292) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4291))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4292) .cse3 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 18:31:12,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4385 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4386))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4385) .cse1 v_ArrVal_4292) (select (select (store .cse2 .cse1 v_ArrVal_4291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4294))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4385 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4386))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4291))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4385) .cse4 v_ArrVal_4292) .cse5 v_ArrVal_4294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-08 18:31:12,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:31:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148632779] [2024-11-08 18:31:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148632779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:31:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [992881612] [2024-11-08 18:31:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:12,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:31:12,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:31:12,399 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:31:12,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-08 18:31:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:17,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 18:31:17,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:31:17,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-08 18:31:17,473 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-08 18:31:17,489 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:31:17,489 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-08 18:31:17,507 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-08 18:31:17,517 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-08 18:31:17,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:31:17,616 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-08 18:31:18,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:18,534 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-08 18:31:18,549 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-08 18:31:18,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:18,676 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-08 18:31:18,687 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-08 18:31:18,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:18,760 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-08 18:31:18,771 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-08 18:31:18,804 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-08 18:31:18,813 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-08 18:31:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:31:18,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:31:18,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-08 18:31:18,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-08 18:31:18,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4809) .cse2 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 18:31:19,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4809) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4810))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4809) .cse3 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 18:31:21,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4903))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) .cse1 v_ArrVal_4809) (select (select (store .cse2 .cse1 v_ArrVal_4810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_4812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4903))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4810))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4904) .cse4 v_ArrVal_4809) .cse5 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-08 18:31:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [992881612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:31:21,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:31:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2024-11-08 18:31:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117878140] [2024-11-08 18:31:21,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:31:21,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:31:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:31:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:31:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=175, Unknown=16, NotChecked=306, Total=552 [2024-11-08 18:31:21,512 INFO L87 Difference]: Start difference. First operand 571 states and 611 transitions. Second operand has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:31:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:30,585 INFO L93 Difference]: Finished difference Result 570 states and 610 transitions. [2024-11-08 18:31:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:31:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-08 18:31:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:30,587 INFO L225 Difference]: With dead ends: 570 [2024-11-08 18:31:30,587 INFO L226 Difference]: Without dead ends: 570 [2024-11-08 18:31:30,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=98, Invalid=383, Unknown=17, NotChecked=432, Total=930 [2024-11-08 18:31:30,588 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 383 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:30,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1062 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-08 18:31:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-08 18:31:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-11-08 18:31:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 403 states have (on average 1.4962779156327544) internal successors, (603), 564 states have internal predecessors, (603), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:31:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 610 transitions. [2024-11-08 18:31:30,599 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 610 transitions. Word has length 122 [2024-11-08 18:31:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:30,600 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 610 transitions. [2024-11-08 18:31:30,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:31:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 610 transitions. [2024-11-08 18:31:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 18:31:30,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:30,602 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:31:30,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-08 18:31:30,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-08 18:31:31,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:31:31,002 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:31:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 42819080, now seen corresponding path program 1 times [2024-11-08 18:31:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:31:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758342266] [2024-11-08 18:31:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:31:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:31:31,004 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:31:31,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-08 18:31:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:31,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 18:31:31,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:31:31,908 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:31:31,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-08 18:31:31,951 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-08 18:31:33,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:33,200 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-08 18:31:33,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:33,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 44 treesize of output 43 [2024-11-08 18:31:33,628 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:33,629 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-08 18:31:33,824 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:33,825 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-08 18:31:33,863 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-08 18:31:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:31:33,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:31:34,038 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5287) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 18:31:34,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:31:34,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5286))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:34,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-08 18:31:34,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5285))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:34,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5285))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:34,914 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-08 18:31:34,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2024-11-08 18:31:34,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5333))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5285)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5286)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5287)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 18:31:34,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:31:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758342266] [2024-11-08 18:31:34,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758342266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:31:34,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1591733334] [2024-11-08 18:31:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:34,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:31:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:31:34,944 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:31:34,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-08 18:31:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:40,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 18:31:40,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:31:40,175 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 18:31:40,175 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-08 18:31:41,143 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 18:31:41,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 18:31:41,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:31:41,849 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 34 treesize of output 16 [2024-11-08 18:31:45,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:45,151 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 54 treesize of output 51 [2024-11-08 18:31:45,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:45,607 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 54 treesize of output 51 [2024-11-08 18:31:45,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:45,922 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 54 treesize of output 51 [2024-11-08 18:31:46,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:31:46,242 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 54 treesize of output 51 [2024-11-08 18:31:46,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-08 18:31:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:31:46,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:31:46,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5718) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 18:31:46,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:31:46,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5717))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:46,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-08 18:31:46,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5716))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:46,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5716))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:47,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5716)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5717)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5718)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:31:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1591733334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:31:47,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:31:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2024-11-08 18:31:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290804904] [2024-11-08 18:31:47,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:31:47,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 18:31:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:31:47,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 18:31:47,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=601, Unknown=14, NotChecked=882, Total=1640 [2024-11-08 18:31:47,326 INFO L87 Difference]: Start difference. First operand 570 states and 610 transitions. Second operand has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:32:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:03,803 INFO L93 Difference]: Finished difference Result 1033 states and 1111 transitions. [2024-11-08 18:32:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 18:32:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2024-11-08 18:32:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:03,807 INFO L225 Difference]: With dead ends: 1033 [2024-11-08 18:32:03,807 INFO L226 Difference]: Without dead ends: 1033 [2024-11-08 18:32:03,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=286, Invalid=1648, Unknown=14, NotChecked=1358, Total=3306 [2024-11-08 18:32:03,808 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1058 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 3438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 3239 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:03,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 3239 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3438 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2024-11-08 18:32:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-08 18:32:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 569. [2024-11-08 18:32:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 403 states have (on average 1.4937965260545907) internal successors, (602), 563 states have internal predecessors, (602), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:32:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 609 transitions. [2024-11-08 18:32:03,822 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 609 transitions. Word has length 125 [2024-11-08 18:32:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:03,822 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 609 transitions. [2024-11-08 18:32:03,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:32:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 609 transitions. [2024-11-08 18:32:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 18:32:03,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:03,824 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:32:03,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-08 18:32:04,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2024-11-08 18:32:04,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:32:04,225 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:32:04,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 42819081, now seen corresponding path program 1 times [2024-11-08 18:32:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:32:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149993344] [2024-11-08 18:32:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:32:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:32:04,229 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:32:04,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-08 18:32:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:04,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 18:32:04,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:32:05,282 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-08 18:32:05,318 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:32:05,319 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-08 18:32:05,386 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-08 18:32:05,396 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-08 18:32:05,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:32:05,686 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-08 18:32:07,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:07,247 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-08 18:32:07,264 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-08 18:32:07,518 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:07,518 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-08 18:32:07,535 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-08 18:32:07,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:07,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 18:32:07,765 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-08 18:32:07,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:07,982 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-08 18:32:08,006 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-08 18:32:08,055 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-08 18:32:08,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 18:32:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:32:08,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:32:08,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2024-11-08 18:32:08,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-08 18:32:08,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6194))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6193) .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6193) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-08 18:32:08,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6194))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6193) .cse1 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6193) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-08 18:32:08,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6191))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6194))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6192) .cse0 v_ArrVal_6193) .cse1 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6191))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6192) .cse6 v_ArrVal_6193) (select (select (store .cse7 .cse6 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6195))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-08 18:32:08,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6191))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6194))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6192) .cse1 v_ArrVal_6193) .cse2 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6191))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6192) .cse7 v_ArrVal_6193) (select (select (store .cse8 .cse7 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6195))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-08 18:32:10,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6288))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6191))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6194))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6287) .cse0 v_ArrVal_6192) .cse1 v_ArrVal_6193) .cse2 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6288))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6191))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6287) .cse8 v_ArrVal_6192) .cse9 v_ArrVal_6193) (select (select (store .cse10 .cse9 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6195))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-08 18:32:10,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:32:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149993344] [2024-11-08 18:32:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149993344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:32:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1979030827] [2024-11-08 18:32:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:10,767 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:32:10,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:32:10,768 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:32:10,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-08 18:32:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:15,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-08 18:32:15,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:32:15,992 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-08 18:32:16,344 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-08 18:32:16,380 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:32:16,381 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-08 18:32:16,407 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-08 18:32:16,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-08 18:32:16,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:32:16,565 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-08 18:32:18,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:18,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 18:32:18,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:32:18,420 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:18,420 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-08 18:32:18,436 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-08 18:32:18,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:18,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 18:32:18,568 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-08 18:32:18,705 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:32:18,706 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-08 18:32:18,729 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-08 18:32:18,777 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-08 18:32:18,792 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-08 18:32:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:32:18,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:32:18,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:32:18,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-08 18:32:19,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6719) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6718))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6719) .cse2 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 18:32:19,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6718))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6719) .cse1 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6719) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-08 18:32:19,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6716))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6718))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6717) .cse0 v_ArrVal_6719) .cse1 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6716))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6717) .cse6 v_ArrVal_6719) (select (select (store .cse7 .cse6 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6720))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2024-11-08 18:32:28,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6813))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6716))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6718))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6812) .cse0 v_ArrVal_6717) .cse1 v_ArrVal_6719) .cse2 v_ArrVal_6720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6720 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6813))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6716))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6812) .cse8 v_ArrVal_6717) .cse9 v_ArrVal_6719) (select (select (store .cse10 .cse9 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6720))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-08 18:32:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1979030827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:32:28,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:32:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2024-11-08 18:32:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232271040] [2024-11-08 18:32:28,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:32:28,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:32:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:32:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:32:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=20, NotChecked=520, Total=812 [2024-11-08 18:32:28,754 INFO L87 Difference]: Start difference. First operand 569 states and 609 transitions. Second operand has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:33:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:44,053 INFO L93 Difference]: Finished difference Result 568 states and 608 transitions. [2024-11-08 18:33:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:33:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-08 18:33:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:44,055 INFO L225 Difference]: With dead ends: 568 [2024-11-08 18:33:44,056 INFO L226 Difference]: Without dead ends: 568 [2024-11-08 18:33:44,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=126, Invalid=458, Unknown=20, NotChecked=728, Total=1332 [2024-11-08 18:33:44,056 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 381 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:44,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1631 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 70.5s Time] [2024-11-08 18:33:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-08 18:33:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2024-11-08 18:33:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 403 states have (on average 1.4913151364764268) internal successors, (601), 562 states have internal predecessors, (601), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:33:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 608 transitions. [2024-11-08 18:33:44,067 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 608 transitions. Word has length 125 [2024-11-08 18:33:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:44,068 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 608 transitions. [2024-11-08 18:33:44,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 18:33:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 608 transitions. [2024-11-08 18:33:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:33:44,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:44,070 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:33:44,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-08 18:33:44,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-08 18:33:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:44,471 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:33:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 565230538, now seen corresponding path program 1 times [2024-11-08 18:33:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:33:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904482249] [2024-11-08 18:33:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:44,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:44,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:44,474 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:33:44,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-08 18:33:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:45,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 18:33:45,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:47,440 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:33:47,441 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-08 18:33:47,736 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-08 18:33:55,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:55,000 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-08 18:33:56,460 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:56,460 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-08 18:33:57,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:57,580 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-08 18:33:58,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:58,760 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-08 18:34:00,031 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:00,031 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-08 18:34:00,268 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-08 18:34:01,302 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-08 18:34:01,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 18:34:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:34:01,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:34:03,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7205) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:34:03,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7204))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:04,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:04,235 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7203))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:04,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:04,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7202))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:04,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7202))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:07,667 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2024-11-08 18:34:07,667 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 205 treesize of output 204 [2024-11-08 18:34:07,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7252))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7202)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7203)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7204)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 18:34:07,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:34:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904482249] [2024-11-08 18:34:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904482249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:34:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1914992118] [2024-11-08 18:34:07,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:07,784 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:34:07,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:34:07,785 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:34:07,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-08 18:34:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:11,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-08 18:34:11,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:34:12,138 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 18:34:12,138 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-08 18:34:18,138 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 18:34:18,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 18:34:19,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:34:22,085 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 34 treesize of output 16 [2024-11-08 18:34:41,122 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:41,123 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 54 treesize of output 51 [2024-11-08 18:34:44,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:44,016 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 54 treesize of output 51 [2024-11-08 18:34:45,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:45,874 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 54 treesize of output 51 [2024-11-08 18:34:47,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:47,807 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 54 treesize of output 51 [2024-11-08 18:34:49,761 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:49,761 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 54 treesize of output 51 [2024-11-08 18:34:50,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-08 18:34:52,530 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2024-11-08 18:34:52,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52 [2024-11-08 18:34:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:34:52,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:34:54,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7645))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:54,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:55,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7644))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:55,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7644))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-08 18:34:55,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7643 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7643))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7644)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-08 18:34:55,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7643 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7643))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7644)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7205)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:58,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1914992118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:34:58,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:34:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 28 [2024-11-08 18:34:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127084470] [2024-11-08 18:34:58,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:34:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 18:34:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:34:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 18:34:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=853, Unknown=21, NotChecked=1022, Total=2070 [2024-11-08 18:34:58,939 INFO L87 Difference]: Start difference. First operand 568 states and 608 transitions. Second operand has 29 states, 26 states have (on average 6.538461538461538) internal successors, (170), 27 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:36:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:03,577 INFO L93 Difference]: Finished difference Result 1029 states and 1107 transitions. [2024-11-08 18:36:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 18:36:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.538461538461538) internal successors, (170), 27 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 129 [2024-11-08 18:36:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:03,581 INFO L225 Difference]: With dead ends: 1029 [2024-11-08 18:36:03,581 INFO L226 Difference]: Without dead ends: 1029 [2024-11-08 18:36:03,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 242 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=318, Invalid=1969, Unknown=25, NotChecked=1470, Total=3782 [2024-11-08 18:36:03,582 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1340 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:03,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 2270 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 56.9s Time] [2024-11-08 18:36:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-08 18:36:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 567. [2024-11-08 18:36:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 403 states have (on average 1.488833746898263) internal successors, (600), 561 states have internal predecessors, (600), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 18:36:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 607 transitions. [2024-11-08 18:36:03,594 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 607 transitions. Word has length 129 [2024-11-08 18:36:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:03,594 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 607 transitions. [2024-11-08 18:36:03,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.538461538461538) internal successors, (170), 27 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:36:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 607 transitions. [2024-11-08 18:36:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:36:03,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:03,596 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:36:03,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-08 18:36:03,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2024-11-08 18:36:03,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 18:36:03,997 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-08 18:36:03,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 565230539, now seen corresponding path program 1 times [2024-11-08 18:36:03,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:03,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271931489] [2024-11-08 18:36:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:03,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:36:03,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:04,000 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:36:04,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-08 18:36:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:04,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-08 18:36:04,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:07,002 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-08 18:36:07,244 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:36:07,245 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-08 18:36:07,645 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-08 18:36:07,688 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-08 18:36:09,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:36:09,104 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-08 18:36:21,768 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:36:21,769 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 75 treesize of output 68 [2024-11-08 18:36:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:36:24,073 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:36:24,074 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 75 treesize of output 68 [2024-11-08 18:36:24,167 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-08 18:36:25,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:36:25,711 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 75 treesize of output 68 [2024-11-08 18:36:25,800 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-08 18:36:27,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:36:27,745 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 75 treesize of output 68 [2024-11-08 18:36:27,839 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-08 18:36:29,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:36:29,723 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 75 treesize of output 68 [2024-11-08 18:36:29,817 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-08 18:36:30,326 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 20 [2024-11-08 18:36:30,468 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-08 18:36:31,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:36:31,586 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-08 18:36:31,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-08 18:36:31,836 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 18:36:31,836 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-08 18:36:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 18:36:32,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:36:42,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_8136 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_8136) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 18:36:43,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8133) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_8136 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8132))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8133) .cse2 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_8136) (select (select (store .cse3 .cse2 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-08 18:36:43,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_8136 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8132))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8133) .cse1 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_8136) (select (select (store .cse3 .cse1 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8133) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2024-11-08 18:36:44,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_8136 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8130))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8132))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8131) .cse0 v_ArrVal_8133) .cse1 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_8136) (select (select (store .cse3 .cse1 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8130))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8131) .cse6 v_ArrVal_8133) (select (select (store .cse7 .cse6 v_ArrVal_8132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8134))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2024-11-08 18:36:53,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8129))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8130))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8128) .cse1 v_ArrVal_8131) .cse2 v_ArrVal_8133) (select (select (store .cse3 .cse2 v_ArrVal_8132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8134))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_8136 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8129))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8130))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8132))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8128) .cse6 v_ArrVal_8131) .cse7 v_ArrVal_8133) .cse8 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_8136) (select (select (store .cse9 .cse8 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 18:36:54,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8129))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8130))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8128) .cse2 v_ArrVal_8131) .cse3 v_ArrVal_8133) (select (select (store .cse4 .cse3 v_ArrVal_8132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_8134))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_8136 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8129))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_8130))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8132))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8128) .cse7 v_ArrVal_8131) .cse8 v_ArrVal_8133) .cse9 v_ArrVal_8134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_8136) (select (select (store .cse10 .cse9 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))) is different from false [2024-11-08 18:36:59,922 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 362 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 18:37:01,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:37:01,347 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 795 treesize of output 819 [2024-11-08 18:37:08,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8136 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (or (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_prenex_37))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_38))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_36))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_33))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_prenex_39) .cse0 v_prenex_40) .cse1 v_prenex_34) .cse2 v_prenex_32) .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_35 v_ArrVal_8136) (select (select (store .cse5 .cse3 v_ArrVal_8135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= v_prenex_35 |c_ULTIMATE.start_main_#t~mem33#1.base|))) (forall ((v_ArrVal_8133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8228))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_8129))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_8130))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8227) .cse10 v_ArrVal_8128) .cse11 v_ArrVal_8131) .cse12 v_ArrVal_8133) (select (select (store .cse13 .cse12 v_ArrVal_8132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8134))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))))) is different from false [2024-11-08 18:37:08,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:37:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271931489] [2024-11-08 18:37:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271931489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [801942751] [2024-11-08 18:37:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:37:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 18:37:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 18:37:08,640 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 18:37:08,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cff0d4-f32f-4dc1-a3d6-a75c783397ea/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-08 18:37:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:12,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-08 18:37:12,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:37:12,756 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