./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:26:19,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:26:19,338 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 18:26:19,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:26:19,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:26:19,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:26:19,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:26:19,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:26:19,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:26:19,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:26:19,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:26:19,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:26:19,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:26:19,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:26:19,396 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:26:19,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:26:19,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:26:19,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:26:19,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:26:19,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:26:19,403 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:26:19,405 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:26:19,405 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:26:19,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:26:19,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:26:19,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:26:19,407 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:26:19,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:26:19,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:26:19,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:26:19,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:26:19,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:26:19,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:26:19,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:19,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:26:19,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:26:19,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:26:19,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:26:19,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:26:19,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:26:19,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:26:19,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:26:19,434 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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-08 18:26:19,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:26:19,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:26:19,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:26:19,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:26:19,886 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:26:19,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i Unable to find full path for "g++" [2024-11-08 18:26:22,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:26:22,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:26:22,430 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-08 18:26:22,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data/afc4bd000/3b2e062cbecc47779e14be1559398dad/FLAG6491d99f0 [2024-11-08 18:26:22,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data/afc4bd000/3b2e062cbecc47779e14be1559398dad [2024-11-08 18:26:22,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:26:22,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:26:22,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:22,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:26:22,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:26:22,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:22" (1/1) ... [2024-11-08 18:26:22,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acc29bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:22, skipping insertion in model container [2024-11-08 18:26:22,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:22" (1/1) ... [2024-11-08 18:26:22,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:26:23,197 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:26:23,257 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:26:23,268 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:26:23,277 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:26:23,293 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:26:23,353 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:26:23,357 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:26:23,360 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:26:23,365 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:26:23,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:23,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:26:23,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:23,550 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:26:23,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23 WrapperNode [2024-11-08 18:26:23,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:23,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:23,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:26:23,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:26:23,562 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:26:23" (1/1) ... [2024-11-08 18:26:23,597 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:26:23" (1/1) ... [2024-11-08 18:26:23,664 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-08 18:26:23,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:23,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:26:23,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:26:23,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:26:23,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,818 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-08 18:26:23,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:26:23,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:26:23,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:26:23,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:26:23,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (1/1) ... [2024-11-08 18:26:23,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:23,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:26:23,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:26:23,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 18:26:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 18:26:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-08 18:26:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 18:26:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 18:26:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-08 18:26:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 18:26:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:26:23,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:26:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 18:26:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:26:23,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:26:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:26:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 18:26:23,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:26:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:26:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 18:26:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:26:23,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:26:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:26:23,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:26:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 18:26:23,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:26:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:26:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 18:26:24,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:26:24,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:26:24,286 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:26:24,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:26:24,292 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:26:24,359 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:26:24,379 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:26:26,839 INFO L? ?]: Removed 1030 outVars from TransFormulas that were not future-live. [2024-11-08 18:26:26,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:26:26,897 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:26:26,901 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-08 18:26:26,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:26 BoogieIcfgContainer [2024-11-08 18:26:26,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:26:26,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:26:26,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:26:26,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:26:26,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:26:22" (1/3) ... [2024-11-08 18:26:26,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514d9ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:26, skipping insertion in model container [2024-11-08 18:26:26,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:23" (2/3) ... [2024-11-08 18:26:26,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514d9ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:26, skipping insertion in model container [2024-11-08 18:26:26,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:26" (3/3) ... [2024-11-08 18:26:26,916 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-11-08 18:26:26,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:26:26,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-08 18:26:27,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:26:27,011 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;@306c1282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:26:27,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-08 18:26:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 1057 states, 635 states have (on average 2.0078740157480315) internal successors, (1275), 1052 states have internal predecessors, (1275), 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:26:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 18:26:27,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:27,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 18:26:27,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:27,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1758814, now seen corresponding path program 1 times [2024-11-08 18:26:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604747570] [2024-11-08 18:26:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:27,385 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,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604747570] [2024-11-08 18:26:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604747570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:27,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:27,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027048878] [2024-11-08 18:26:27,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:27,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:27,438 INFO L87 Difference]: Start difference. First operand has 1057 states, 635 states have (on average 2.0078740157480315) internal successors, (1275), 1052 states have internal predecessors, (1275), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:28,893 INFO L93 Difference]: Finished difference Result 1355 states and 1614 transitions. [2024-11-08 18:26:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:28,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 18:26:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:28,916 INFO L225 Difference]: With dead ends: 1355 [2024-11-08 18:26:28,917 INFO L226 Difference]: Without dead ends: 1351 [2024-11-08 18:26:28,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:26:28,922 INFO L432 NwaCegarLoop]: 1106 mSDtfsCounter, 386 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:28,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2672 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:26:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-08 18:26:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1266. [2024-11-08 18:26:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 850 states have (on average 1.8823529411764706) internal successors, (1600), 1261 states have internal predecessors, (1600), 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:26:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1606 transitions. [2024-11-08 18:26:29,053 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1606 transitions. Word has length 4 [2024-11-08 18:26:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:29,054 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1606 transitions. [2024-11-08 18:26:29,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1606 transitions. [2024-11-08 18:26:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 18:26:29,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:29,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 18:26:29,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:26:29,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:29,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-08 18:26:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116000262] [2024-11-08 18:26:29,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:29,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116000262] [2024-11-08 18:26:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116000262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400367104] [2024-11-08 18:26:29,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:29,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:29,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:29,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:29,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:29,149 INFO L87 Difference]: Start difference. First operand 1266 states and 1606 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:29,825 INFO L93 Difference]: Finished difference Result 1263 states and 1598 transitions. [2024-11-08 18:26:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 18:26:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:29,831 INFO L225 Difference]: With dead ends: 1263 [2024-11-08 18:26:29,831 INFO L226 Difference]: Without dead ends: 1263 [2024-11-08 18:26:29,832 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:26:29,833 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 1094 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:29,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 869 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:26:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-08 18:26:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2024-11-08 18:26:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 858 states have (on average 1.8554778554778555) internal successors, (1592), 1258 states have internal predecessors, (1592), 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:26:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1598 transitions. [2024-11-08 18:26:29,865 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1598 transitions. Word has length 4 [2024-11-08 18:26:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:29,865 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1598 transitions. [2024-11-08 18:26:29,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1598 transitions. [2024-11-08 18:26:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 18:26:29,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:29,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 18:26:29,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:26:29,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:29,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-08 18:26:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123312946] [2024-11-08 18:26:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:29,960 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:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123312946] [2024-11-08 18:26:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123312946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964449411] [2024-11-08 18:26:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:29,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:29,963 INFO L87 Difference]: Start difference. First operand 1263 states and 1598 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:30,803 INFO L93 Difference]: Finished difference Result 1347 states and 1593 transitions. [2024-11-08 18:26:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:30,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 18:26:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:30,809 INFO L225 Difference]: With dead ends: 1347 [2024-11-08 18:26:30,810 INFO L226 Difference]: Without dead ends: 1347 [2024-11-08 18:26:30,810 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:26:30,811 INFO L432 NwaCegarLoop]: 1108 mSDtfsCounter, 384 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:30,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1890 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:26:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-08 18:26:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1262. [2024-11-08 18:26:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 858 states have (on average 1.8473193473193472) internal successors, (1585), 1257 states have internal predecessors, (1585), 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:26:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1591 transitions. [2024-11-08 18:26:30,844 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1591 transitions. Word has length 4 [2024-11-08 18:26:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:30,845 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1591 transitions. [2024-11-08 18:26:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1591 transitions. [2024-11-08 18:26:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:26:30,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:30,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:30,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:26:30,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:30,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-08 18:26:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867697025] [2024-11-08 18:26:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:31,071 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,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867697025] [2024-11-08 18:26:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867697025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:31,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872282090] [2024-11-08 18:26:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:31,074 INFO L87 Difference]: Start difference. First operand 1262 states and 1591 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:32,502 INFO L93 Difference]: Finished difference Result 1336 states and 1581 transitions. [2024-11-08 18:26:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 18:26:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:32,511 INFO L225 Difference]: With dead ends: 1336 [2024-11-08 18:26:32,511 INFO L226 Difference]: Without dead ends: 1336 [2024-11-08 18:26:32,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:32,513 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 3345 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3345 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:32,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3345 Valid, 1126 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:26:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-08 18:26:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1251. [2024-11-08 18:26:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 858 states have (on average 1.8333333333333333) internal successors, (1573), 1246 states have internal predecessors, (1573), 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:26:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1579 transitions. [2024-11-08 18:26:32,546 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1579 transitions. Word has length 8 [2024-11-08 18:26:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1579 transitions. [2024-11-08 18:26:32,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1579 transitions. [2024-11-08 18:26:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 18:26:32,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:32,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:32,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:26:32,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:32,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-08 18:26:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149074390] [2024-11-08 18:26:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:32,647 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:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149074390] [2024-11-08 18:26:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149074390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177024085] [2024-11-08 18:26:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:32,650 INFO L87 Difference]: Start difference. First operand 1251 states and 1579 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:26:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:33,489 INFO L93 Difference]: Finished difference Result 1289 states and 1534 transitions. [2024-11-08 18:26:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:33,489 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:26:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:33,494 INFO L225 Difference]: With dead ends: 1289 [2024-11-08 18:26:33,494 INFO L226 Difference]: Without dead ends: 1289 [2024-11-08 18:26:33,494 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:26:33,495 INFO L432 NwaCegarLoop]: 1123 mSDtfsCounter, 1068 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:33,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1423 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:26:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-08 18:26:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1204. [2024-11-08 18:26:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 858 states have (on average 1.7785547785547786) internal successors, (1526), 1199 states have internal predecessors, (1526), 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:26:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1532 transitions. [2024-11-08 18:26:33,545 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1532 transitions. Word has length 9 [2024-11-08 18:26:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:33,546 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1532 transitions. [2024-11-08 18:26:33,546 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:26:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1532 transitions. [2024-11-08 18:26:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 18:26:33,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:33,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:33,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:26:33,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-08 18:26:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031655689] [2024-11-08 18:26:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:33,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:26:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031655689] [2024-11-08 18:26:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031655689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:33,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659146349] [2024-11-08 18:26:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:33,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:33,681 INFO L87 Difference]: Start difference. First operand 1204 states and 1532 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:26:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:34,465 INFO L93 Difference]: Finished difference Result 1491 states and 1897 transitions. [2024-11-08 18:26:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:34,466 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:26:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:34,470 INFO L225 Difference]: With dead ends: 1491 [2024-11-08 18:26:34,471 INFO L226 Difference]: Without dead ends: 1491 [2024-11-08 18:26:34,471 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:26:34,472 INFO L432 NwaCegarLoop]: 1256 mSDtfsCounter, 858 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:34,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1676 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:26:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2024-11-08 18:26:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1179. [2024-11-08 18:26:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 858 states have (on average 1.7494172494172495) internal successors, (1501), 1174 states have internal predecessors, (1501), 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:26:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1507 transitions. [2024-11-08 18:26:34,497 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1507 transitions. Word has length 9 [2024-11-08 18:26:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:34,497 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1507 transitions. [2024-11-08 18:26:34,498 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:26:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1507 transitions. [2024-11-08 18:26:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:26:34,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:34,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:34,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:26:34,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1409972164, now seen corresponding path program 1 times [2024-11-08 18:26:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159611090] [2024-11-08 18:26:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159611090] [2024-11-08 18:26:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159611090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737173195] [2024-11-08 18:26:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:34,565 INFO L87 Difference]: Start difference. First operand 1179 states and 1507 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:35,365 INFO L93 Difference]: Finished difference Result 1254 states and 1613 transitions. [2024-11-08 18:26:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:35,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 18:26:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:35,371 INFO L225 Difference]: With dead ends: 1254 [2024-11-08 18:26:35,371 INFO L226 Difference]: Without dead ends: 1254 [2024-11-08 18:26:35,371 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:26:35,372 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 1295 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:35,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 1412 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:26:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-08 18:26:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1156. [2024-11-08 18:26:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 858 states have (on average 1.6958041958041958) internal successors, (1455), 1151 states have internal predecessors, (1455), 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:26:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1461 transitions. [2024-11-08 18:26:35,398 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1461 transitions. Word has length 15 [2024-11-08 18:26:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:35,399 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1461 transitions. [2024-11-08 18:26:35,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1461 transitions. [2024-11-08 18:26:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:26:35,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:35,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:35,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:26:35,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:35,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1409972163, now seen corresponding path program 1 times [2024-11-08 18:26:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080367484] [2024-11-08 18:26:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:35,489 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:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:35,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080367484] [2024-11-08 18:26:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080367484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:35,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510875516] [2024-11-08 18:26:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:35,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:35,491 INFO L87 Difference]: Start difference. First operand 1156 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:35,526 INFO L93 Difference]: Finished difference Result 1016 states and 1251 transitions. [2024-11-08 18:26:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:35,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 18:26:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:35,530 INFO L225 Difference]: With dead ends: 1016 [2024-11-08 18:26:35,530 INFO L226 Difference]: Without dead ends: 1016 [2024-11-08 18:26:35,530 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:26:35,531 INFO L432 NwaCegarLoop]: 977 mSDtfsCounter, 61 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1901 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:26:35,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1901 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-08 18:26:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-08 18:26:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 730 states have (on average 1.7054794520547945) internal successors, (1245), 1011 states have internal predecessors, (1245), 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:26:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1251 transitions. [2024-11-08 18:26:35,555 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1251 transitions. Word has length 15 [2024-11-08 18:26:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1251 transitions. [2024-11-08 18:26:35,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1251 transitions. [2024-11-08 18:26:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 18:26:35,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:35,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:35,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:26:35,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:35,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -752693253, now seen corresponding path program 1 times [2024-11-08 18:26:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729669192] [2024-11-08 18:26:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:35,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:26:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729669192] [2024-11-08 18:26:35,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729669192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:35,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:35,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383890736] [2024-11-08 18:26:35,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:35,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:35,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:35,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:35,626 INFO L87 Difference]: Start difference. First operand 1016 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:35,697 INFO L93 Difference]: Finished difference Result 987 states and 1201 transitions. [2024-11-08 18:26:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 18:26:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:35,701 INFO L225 Difference]: With dead ends: 987 [2024-11-08 18:26:35,701 INFO L226 Difference]: Without dead ends: 987 [2024-11-08 18:26:35,702 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:26:35,702 INFO L432 NwaCegarLoop]: 942 mSDtfsCounter, 41 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2798 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:35,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2798 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-08 18:26:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 981. [2024-11-08 18:26:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 702 states have (on average 1.6937321937321936) internal successors, (1189), 976 states have internal predecessors, (1189), 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:26:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1195 transitions. [2024-11-08 18:26:35,724 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1195 transitions. Word has length 16 [2024-11-08 18:26:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:35,724 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1195 transitions. [2024-11-08 18:26:35,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1195 transitions. [2024-11-08 18:26:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 18:26:35,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:35,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:35,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:26:35,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1271928384, now seen corresponding path program 1 times [2024-11-08 18:26:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484810041] [2024-11-08 18:26:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:35,790 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:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:35,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484810041] [2024-11-08 18:26:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484810041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484023494] [2024-11-08 18:26:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:35,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:35,793 INFO L87 Difference]: Start difference. First operand 981 states and 1195 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:36,611 INFO L93 Difference]: Finished difference Result 1050 states and 1250 transitions. [2024-11-08 18:26:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-08 18:26:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:36,614 INFO L225 Difference]: With dead ends: 1050 [2024-11-08 18:26:36,615 INFO L226 Difference]: Without dead ends: 1050 [2024-11-08 18:26:36,615 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:26:36,615 INFO L432 NwaCegarLoop]: 829 mSDtfsCounter, 1178 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:36,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1659 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:26:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-08 18:26:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 958. [2024-11-08 18:26:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 702 states have (on average 1.660968660968661) internal successors, (1166), 953 states have internal predecessors, (1166), 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:26:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1172 transitions. [2024-11-08 18:26:36,636 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1172 transitions. Word has length 20 [2024-11-08 18:26:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:36,637 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1172 transitions. [2024-11-08 18:26:36,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1172 transitions. [2024-11-08 18:26:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 18:26:36,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:36,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:36,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:26:36,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:36,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1271928383, now seen corresponding path program 1 times [2024-11-08 18:26:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:36,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346608017] [2024-11-08 18:26:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:36,717 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,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346608017] [2024-11-08 18:26:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346608017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104987923] [2024-11-08 18:26:36,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:36,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:36,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:36,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:36,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:36,719 INFO L87 Difference]: Start difference. First operand 958 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:36,750 INFO L93 Difference]: Finished difference Result 882 states and 1067 transitions. [2024-11-08 18:26:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-08 18:26:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:36,754 INFO L225 Difference]: With dead ends: 882 [2024-11-08 18:26:36,754 INFO L226 Difference]: Without dead ends: 882 [2024-11-08 18:26:36,754 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:26:36,755 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 61 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1589 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:26:36,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1589 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-08 18:26:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-11-08 18:26:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 638 states have (on average 1.6630094043887147) internal successors, (1061), 877 states have internal predecessors, (1061), 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:26:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1067 transitions. [2024-11-08 18:26:36,795 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1067 transitions. Word has length 20 [2024-11-08 18:26:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:36,796 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1067 transitions. [2024-11-08 18:26:36,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1067 transitions. [2024-11-08 18:26:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 18:26:36,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:36,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:36,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:26:36,799 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash -768304611, now seen corresponding path program 1 times [2024-11-08 18:26:36,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:36,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751633979] [2024-11-08 18:26:36,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:36,882 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,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751633979] [2024-11-08 18:26:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751633979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709526810] [2024-11-08 18:26:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:36,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:36,886 INFO L87 Difference]: Start difference. First operand 882 states and 1067 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:36,952 INFO L93 Difference]: Finished difference Result 864 states and 1042 transitions. [2024-11-08 18:26:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-08 18:26:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:36,955 INFO L225 Difference]: With dead ends: 864 [2024-11-08 18:26:36,955 INFO L226 Difference]: Without dead ends: 864 [2024-11-08 18:26:36,958 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:26:36,959 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 41 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2330 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:36,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2330 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-08 18:26:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 861. [2024-11-08 18:26:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 624 states have (on average 1.6554487179487178) internal successors, (1033), 856 states have internal predecessors, (1033), 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:26:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1039 transitions. [2024-11-08 18:26:36,979 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1039 transitions. Word has length 21 [2024-11-08 18:26:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:36,980 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1039 transitions. [2024-11-08 18:26:36,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1039 transitions. [2024-11-08 18:26:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 18:26:36,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:36,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:36,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:26:36,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:36,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash -607542615, now seen corresponding path program 1 times [2024-11-08 18:26:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:36,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989175712] [2024-11-08 18:26:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:37,162 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:37,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989175712] [2024-11-08 18:26:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989175712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018064391] [2024-11-08 18:26:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:37,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:37,165 INFO L87 Difference]: Start difference. First operand 861 states and 1039 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:37,885 INFO L93 Difference]: Finished difference Result 949 states and 1113 transitions. [2024-11-08 18:26:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-08 18:26:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:37,889 INFO L225 Difference]: With dead ends: 949 [2024-11-08 18:26:37,889 INFO L226 Difference]: Without dead ends: 949 [2024-11-08 18:26:37,889 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:26:37,890 INFO L432 NwaCegarLoop]: 755 mSDtfsCounter, 383 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:37,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1755 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:26:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-08 18:26:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 861. [2024-11-08 18:26:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 624 states have (on average 1.6490384615384615) internal successors, (1029), 856 states have internal predecessors, (1029), 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:26:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1035 transitions. [2024-11-08 18:26:37,909 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1035 transitions. Word has length 30 [2024-11-08 18:26:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:37,909 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1035 transitions. [2024-11-08 18:26:37,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1035 transitions. [2024-11-08 18:26:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:26:37,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:37,911 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] [2024-11-08 18:26:37,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:26:37,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:37,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1697897099, now seen corresponding path program 1 times [2024-11-08 18:26:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961454943] [2024-11-08 18:26:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:38,116 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:38,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:38,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961454943] [2024-11-08 18:26:38,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961454943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:38,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:38,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568229516] [2024-11-08 18:26:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:38,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:38,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:38,119 INFO L87 Difference]: Start difference. First operand 861 states and 1035 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:38,893 INFO L93 Difference]: Finished difference Result 1184 states and 1432 transitions. [2024-11-08 18:26:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:38,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-08 18:26:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:38,899 INFO L225 Difference]: With dead ends: 1184 [2024-11-08 18:26:38,899 INFO L226 Difference]: Without dead ends: 1184 [2024-11-08 18:26:38,899 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:26:38,900 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 649 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:38,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1909 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:26:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-11-08 18:26:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 857. [2024-11-08 18:26:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 624 states have (on average 1.642628205128205) internal successors, (1025), 852 states have internal predecessors, (1025), 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:26:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1031 transitions. [2024-11-08 18:26:38,919 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1031 transitions. Word has length 35 [2024-11-08 18:26:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:38,919 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1031 transitions. [2024-11-08 18:26:38,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1031 transitions. [2024-11-08 18:26:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:26:38,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:38,921 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] [2024-11-08 18:26:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:26:38,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:38,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1487707269, now seen corresponding path program 1 times [2024-11-08 18:26:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:38,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132309095] [2024-11-08 18:26:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:39,011 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:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:39,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132309095] [2024-11-08 18:26:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132309095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:39,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:39,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:39,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940123072] [2024-11-08 18:26:39,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:39,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:39,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:39,013 INFO L87 Difference]: Start difference. First operand 857 states and 1031 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:39,072 INFO L93 Difference]: Finished difference Result 857 states and 1023 transitions. [2024-11-08 18:26:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:39,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-08 18:26:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:39,075 INFO L225 Difference]: With dead ends: 857 [2024-11-08 18:26:39,075 INFO L226 Difference]: Without dead ends: 857 [2024-11-08 18:26:39,076 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:26:39,076 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 27 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2306 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:39,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2306 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-08 18:26:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2024-11-08 18:26:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 624 states have (on average 1.6298076923076923) internal successors, (1017), 852 states have internal predecessors, (1017), 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:26:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1023 transitions. [2024-11-08 18:26:39,092 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1023 transitions. Word has length 62 [2024-11-08 18:26:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:39,092 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1023 transitions. [2024-11-08 18:26:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1023 transitions. [2024-11-08 18:26:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 18:26:39,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:39,094 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] [2024-11-08 18:26:39,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:26:39,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:39,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash -267693667, now seen corresponding path program 1 times [2024-11-08 18:26:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135037085] [2024-11-08 18:26:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:39,212 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:39,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:39,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135037085] [2024-11-08 18:26:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135037085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:39,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749230858] [2024-11-08 18:26:39,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:39,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:39,217 INFO L87 Difference]: Start difference. First operand 857 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:39,275 INFO L93 Difference]: Finished difference Result 857 states and 1019 transitions. [2024-11-08 18:26:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-08 18:26:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:39,279 INFO L225 Difference]: With dead ends: 857 [2024-11-08 18:26:39,279 INFO L226 Difference]: Without dead ends: 857 [2024-11-08 18:26:39,280 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:26:39,280 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 21 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2300 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:39,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2300 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-08 18:26:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2024-11-08 18:26:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 624 states have (on average 1.623397435897436) internal successors, (1013), 852 states have internal predecessors, (1013), 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:26:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1019 transitions. [2024-11-08 18:26:39,298 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1019 transitions. Word has length 69 [2024-11-08 18:26:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:39,299 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1019 transitions. [2024-11-08 18:26:39,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1019 transitions. [2024-11-08 18:26:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 18:26:39,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:39,301 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] [2024-11-08 18:26:39,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:26:39,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:39,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1846394823, now seen corresponding path program 1 times [2024-11-08 18:26:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:39,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433540781] [2024-11-08 18:26:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:39,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:39,451 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:39,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:39,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433540781] [2024-11-08 18:26:39,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433540781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:39,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:39,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:26:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675214248] [2024-11-08 18:26:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:39,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:39,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:39,454 INFO L87 Difference]: Start difference. First operand 857 states and 1019 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:39,528 INFO L93 Difference]: Finished difference Result 1020 states and 1190 transitions. [2024-11-08 18:26:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-08 18:26:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:39,532 INFO L225 Difference]: With dead ends: 1020 [2024-11-08 18:26:39,532 INFO L226 Difference]: Without dead ends: 1020 [2024-11-08 18:26:39,532 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:26:39,533 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 198 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:39,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1544 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-08 18:26:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1010. [2024-11-08 18:26:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 777 states have (on average 1.5186615186615187) internal successors, (1180), 1005 states have internal predecessors, (1180), 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:26:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1186 transitions. [2024-11-08 18:26:39,554 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1186 transitions. Word has length 70 [2024-11-08 18:26:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:39,554 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1186 transitions. [2024-11-08 18:26:39,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1186 transitions. [2024-11-08 18:26:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 18:26:39,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:39,556 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] [2024-11-08 18:26:39,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:26:39,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 438438093, now seen corresponding path program 1 times [2024-11-08 18:26:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054559850] [2024-11-08 18:26:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:40,014 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:40,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054559850] [2024-11-08 18:26:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054559850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:40,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:26:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915123890] [2024-11-08 18:26:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:26:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:26:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:40,017 INFO L87 Difference]: Start difference. First operand 1010 states and 1186 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:26:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:40,201 INFO L93 Difference]: Finished difference Result 1484 states and 1692 transitions. [2024-11-08 18:26:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-08 18:26:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:40,206 INFO L225 Difference]: With dead ends: 1484 [2024-11-08 18:26:40,206 INFO L226 Difference]: Without dead ends: 1481 [2024-11-08 18:26:40,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:26:40,207 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 733 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 3849 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:40,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 3849 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2024-11-08 18:26:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 911. [2024-11-08 18:26:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 678 states have (on average 1.551622418879056) internal successors, (1052), 906 states have internal predecessors, (1052), 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:26:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1058 transitions. [2024-11-08 18:26:40,250 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1058 transitions. Word has length 76 [2024-11-08 18:26:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:40,251 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1058 transitions. [2024-11-08 18:26:40,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:26:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1058 transitions. [2024-11-08 18:26:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 18:26:40,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:40,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:26:40,253 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:40,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1698343876, now seen corresponding path program 1 times [2024-11-08 18:26:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:40,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182050030] [2024-11-08 18:26:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182050030] [2024-11-08 18:26:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182050030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:40,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:40,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525055448] [2024-11-08 18:26:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:40,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:40,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:40,601 INFO L87 Difference]: Start difference. First operand 911 states and 1058 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:41,381 INFO L93 Difference]: Finished difference Result 910 states and 1057 transitions. [2024-11-08 18:26:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:41,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-08 18:26:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:41,386 INFO L225 Difference]: With dead ends: 910 [2024-11-08 18:26:41,387 INFO L226 Difference]: Without dead ends: 910 [2024-11-08 18:26:41,387 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:26:41,388 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 2 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:41,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2299 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:26:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-08 18:26:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2024-11-08 18:26:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 678 states have (on average 1.5501474926253687) internal successors, (1051), 905 states have internal predecessors, (1051), 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:26:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1057 transitions. [2024-11-08 18:26:41,403 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1057 transitions. Word has length 85 [2024-11-08 18:26:41,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:41,404 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1057 transitions. [2024-11-08 18:26:41,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1057 transitions. [2024-11-08 18:26:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 18:26:41,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:41,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:26:41,409 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1698343875, now seen corresponding path program 1 times [2024-11-08 18:26:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:41,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712875991] [2024-11-08 18:26:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:42,135 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:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712875991] [2024-11-08 18:26:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712875991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:42,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420775492] [2024-11-08 18:26:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:42,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:42,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:42,138 INFO L87 Difference]: Start difference. First operand 910 states and 1057 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:43,171 INFO L93 Difference]: Finished difference Result 909 states and 1056 transitions. [2024-11-08 18:26:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-08 18:26:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:43,175 INFO L225 Difference]: With dead ends: 909 [2024-11-08 18:26:43,176 INFO L226 Difference]: Without dead ends: 909 [2024-11-08 18:26:43,176 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:26:43,177 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 1 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:43,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2258 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:26:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-08 18:26:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2024-11-08 18:26:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 677 states have (on average 1.5509601181683899) internal successors, (1050), 904 states have internal predecessors, (1050), 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:26:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1056 transitions. [2024-11-08 18:26:43,202 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1056 transitions. Word has length 85 [2024-11-08 18:26:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:43,202 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1056 transitions. [2024-11-08 18:26:43,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1056 transitions. [2024-11-08 18:26:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 18:26:43,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:43,204 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:26:43,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:26:43,204 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:43,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:43,205 INFO L85 PathProgramCache]: Analyzing trace with hash -355007197, now seen corresponding path program 1 times [2024-11-08 18:26:43,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:43,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798558877] [2024-11-08 18:26:43,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:26:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:43,588 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:43,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:43,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798558877] [2024-11-08 18:26:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798558877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:43,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:43,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520017152] [2024-11-08 18:26:43,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:43,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:26:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:43,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:26:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:43,591 INFO L87 Difference]: Start difference. First operand 909 states and 1056 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 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:26:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:44,679 INFO L93 Difference]: Finished difference Result 921 states and 1071 transitions. [2024-11-08 18:26:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:26:44,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 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:26:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:44,685 INFO L225 Difference]: With dead ends: 921 [2024-11-08 18:26:44,685 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 18:26:44,686 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:26:44,686 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 10 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3556 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:44,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3556 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:26:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 18:26:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2024-11-08 18:26:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 682 states have (on average 1.5498533724340176) internal successors, (1057), 909 states have internal predecessors, (1057), 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:26:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1066 transitions. [2024-11-08 18:26:44,705 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1066 transitions. Word has length 93 [2024-11-08 18:26:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:44,705 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1066 transitions. [2024-11-08 18:26:44,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 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:26:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1066 transitions. [2024-11-08 18:26:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 18:26:44,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:44,707 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:26:44,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:26:44,707 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:44,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -355007196, now seen corresponding path program 1 times [2024-11-08 18:26:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:44,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146472490] [2024-11-08 18:26:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:26:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:45,508 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:45,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:45,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146472490] [2024-11-08 18:26:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146472490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648727292] [2024-11-08 18:26:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:45,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:26:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:26:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:45,511 INFO L87 Difference]: Start difference. First operand 915 states and 1066 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:26:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:46,593 INFO L93 Difference]: Finished difference Result 915 states and 1065 transitions. [2024-11-08 18:26:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:26:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:46,597 INFO L225 Difference]: With dead ends: 915 [2024-11-08 18:26:46,597 INFO L226 Difference]: Without dead ends: 915 [2024-11-08 18:26:46,601 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:26:46,602 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 5 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:46,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2922 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:26:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-11-08 18:26:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2024-11-08 18:26:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 682 states have (on average 1.5483870967741935) internal successors, (1056), 909 states have internal predecessors, (1056), 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:26:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1065 transitions. [2024-11-08 18:26:46,625 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1065 transitions. Word has length 93 [2024-11-08 18:26:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:46,625 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1065 transitions. [2024-11-08 18:26:46,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:26:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1065 transitions. [2024-11-08 18:26:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:26:46,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:46,627 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:26:46,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:26:46,628 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1794296714, now seen corresponding path program 1 times [2024-11-08 18:26:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989008007] [2024-11-08 18:26:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:47,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:26:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:47,435 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:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989008007] [2024-11-08 18:26:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989008007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450921018] [2024-11-08 18:26:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:26:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:47,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:26:47,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:26:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:47,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 18:26:47,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:47,750 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:47,921 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:26:47,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:26:47,966 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:48,078 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:26:48,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:48,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 42 treesize of output 41 [2024-11-08 18:26:48,352 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:26:48,403 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:48,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:26:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450921018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:48,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:26:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-08 18:26:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743920445] [2024-11-08 18:26:48,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:26:48,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:26:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:48,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:26:48,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=321, Unknown=5, NotChecked=0, Total=380 [2024-11-08 18:26:48,493 INFO L87 Difference]: Start difference. First operand 915 states and 1065 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:51,236 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2024-11-08 18:26:51,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:26:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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:26:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:51,240 INFO L225 Difference]: With dead ends: 922 [2024-11-08 18:26:51,240 INFO L226 Difference]: Without dead ends: 922 [2024-11-08 18:26:51,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=508, Unknown=5, NotChecked=0, Total=600 [2024-11-08 18:26:51,241 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 702 mSDsluCounter, 5259 mSDsCounter, 0 mSdLazyCounter, 3638 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 5752 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:51,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 5752 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3638 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:26:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-08 18:26:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-08 18:26:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 686 states have (on average 1.5451895043731778) internal successors, (1060), 912 states have internal predecessors, (1060), 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:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1067 transitions. [2024-11-08 18:26:51,260 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1067 transitions. Word has length 94 [2024-11-08 18:26:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:51,261 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1067 transitions. [2024-11-08 18:26:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1067 transitions. [2024-11-08 18:26:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 18:26:51,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:51,262 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:26:51,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:26:51,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-08 18:26:51,464 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1794296713, now seen corresponding path program 1 times [2024-11-08 18:26:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645576862] [2024-11-08 18:26:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:51,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:26:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:52,515 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:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645576862] [2024-11-08 18:26:52,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645576862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39558888] [2024-11-08 18:26:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:52,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:26:52,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:52,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:26:52,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:26:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:52,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 18:26:52,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:52,793 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:52,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:26:52,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:26:52,977 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:26:53,020 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:53,025 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:26:53,166 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:26:53,171 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:26:53,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:26:53,320 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:26:53,326 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:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:26:53,385 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:26:53,407 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,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:26:53,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_798) |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~mem54#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_798 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:26:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39558888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:26:53,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:26:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-08 18:26:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331698901] [2024-11-08 18:26:53,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:26:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:26:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:26:53,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-08 18:26:53,533 INFO L87 Difference]: Start difference. First operand 919 states and 1067 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:56,693 INFO L93 Difference]: Finished difference Result 921 states and 1071 transitions. [2024-11-08 18:26:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:26:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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:26:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:56,698 INFO L225 Difference]: With dead ends: 921 [2024-11-08 18:26:56,698 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 18:26:56,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-08 18:26:56,699 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 702 mSDsluCounter, 4186 mSDsCounter, 0 mSdLazyCounter, 3984 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:56,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 4682 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3984 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 18:26:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 18:26:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 912. [2024-11-08 18:26:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 681 states have (on average 1.5462555066079295) internal successors, (1053), 906 states have internal predecessors, (1053), 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:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1059 transitions. [2024-11-08 18:26:56,727 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1059 transitions. Word has length 94 [2024-11-08 18:26:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1059 transitions. [2024-11-08 18:26:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1059 transitions. [2024-11-08 18:26:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 18:26:56,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:56,729 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:26:56,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:26:56,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-08 18:26:56,930 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1809290499, now seen corresponding path program 1 times [2024-11-08 18:26:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828473332] [2024-11-08 18:26:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:26:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:57,641 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:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828473332] [2024-11-08 18:26:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828473332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:26:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039721252] [2024-11-08 18:26:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:26:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:57,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:26:57,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:26:57,644 INFO L87 Difference]: Start difference. First operand 912 states and 1059 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 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:26:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:59,562 INFO L93 Difference]: Finished difference Result 925 states and 1075 transitions. [2024-11-08 18:26:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:26:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 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:26:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:59,566 INFO L225 Difference]: With dead ends: 925 [2024-11-08 18:26:59,567 INFO L226 Difference]: Without dead ends: 925 [2024-11-08 18:26:59,567 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:26:59,568 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 732 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 4796 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:59,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 4796 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:26:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-08 18:26:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2024-11-08 18:26:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 689 states have (on average 1.5428156748911466) internal successors, (1063), 914 states have internal predecessors, (1063), 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:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1070 transitions. [2024-11-08 18:26:59,585 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1070 transitions. Word has length 96 [2024-11-08 18:26:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1070 transitions. [2024-11-08 18:26:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 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:26:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1070 transitions. [2024-11-08 18:26:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 18:26:59,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:59,587 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:26:59,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:26:59,587 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:26:59,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1809290498, now seen corresponding path program 1 times [2024-11-08 18:26:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:59,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96128868] [2024-11-08 18:26:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:59,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:00,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:00,452 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:27:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96128868] [2024-11-08 18:27:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96128868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:00,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 18:27:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511117534] [2024-11-08 18:27:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:27:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:27:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:27:00,455 INFO L87 Difference]: Start difference. First operand 921 states and 1070 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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:27:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:02,517 INFO L93 Difference]: Finished difference Result 924 states and 1074 transitions. [2024-11-08 18:27:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:27:02,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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:27:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:02,520 INFO L225 Difference]: With dead ends: 924 [2024-11-08 18:27:02,520 INFO L226 Difference]: Without dead ends: 924 [2024-11-08 18:27:02,521 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:27:02,521 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 728 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:02,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3359 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 18:27:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-08 18:27:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-08 18:27:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 689 states have (on average 1.5413642960812772) internal successors, (1062), 914 states have internal predecessors, (1062), 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:27:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1069 transitions. [2024-11-08 18:27:02,537 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1069 transitions. Word has length 96 [2024-11-08 18:27:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1069 transitions. [2024-11-08 18:27:02,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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:27:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1069 transitions. [2024-11-08 18:27:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:27:02,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:02,539 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:27:02,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:27:02,539 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:02,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1270191818, now seen corresponding path program 1 times [2024-11-08 18:27:02,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:02,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889881818] [2024-11-08 18:27:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:03,281 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:27:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889881818] [2024-11-08 18:27:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889881818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432969730] [2024-11-08 18:27:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:03,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:03,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:03,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:03,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:27:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:03,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 18:27:03,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:03,570 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:27:03,715 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:27:03,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:27:03,750 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:03,845 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:04,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:04,012 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:04,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:04,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 42 treesize of output 41 [2024-11-08 18:27:04,143 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:04,191 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:27:04,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:04,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1086 (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_1089))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432969730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:04,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-08 18:27:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941758528] [2024-11-08 18:27:04,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:04,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:27:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:27:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=461, Unknown=15, NotChecked=44, Total=600 [2024-11-08 18:27:04,317 INFO L87 Difference]: Start difference. First operand 921 states and 1069 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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:27:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:07,290 INFO L93 Difference]: Finished difference Result 923 states and 1073 transitions. [2024-11-08 18:27:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:27:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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:27:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:07,292 INFO L225 Difference]: With dead ends: 923 [2024-11-08 18:27:07,293 INFO L226 Difference]: Without dead ends: 923 [2024-11-08 18:27:07,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=637, Unknown=15, NotChecked=52, Total=812 [2024-11-08 18:27:07,294 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 697 mSDsluCounter, 6234 mSDsCounter, 0 mSdLazyCounter, 4271 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 6726 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:07,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 6726 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4271 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 18:27:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-08 18:27:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-08 18:27:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 689 states have (on average 1.5399129172714079) internal successors, (1061), 913 states have internal predecessors, (1061), 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:27:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1068 transitions. [2024-11-08 18:27:07,309 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1068 transitions. Word has length 97 [2024-11-08 18:27:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:07,310 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1068 transitions. [2024-11-08 18:27:07,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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:27:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1068 transitions. [2024-11-08 18:27:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:27:07,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:07,311 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:27:07,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:27:07,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 18:27:07,512 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:07,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:07,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1270191819, now seen corresponding path program 1 times [2024-11-08 18:27:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685042386] [2024-11-08 18:27:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:08,491 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:27:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685042386] [2024-11-08 18:27:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685042386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499563377] [2024-11-08 18:27:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:08,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:08,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:27:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:08,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 18:27:08,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:08,783 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:27:08,909 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:08,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:27:08,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 11 treesize of output 11 [2024-11-08 18:27:08,950 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:08,956 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:27:09,071 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:09,076 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:27:09,206 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:09,206 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:27:09,213 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:27:09,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:09,320 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:27:09,329 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:27:09,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:27:09,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 18:27:09,381 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:27:09,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:09,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1254))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1253) .cse0 v_ArrVal_1247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1253) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1254) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-08 18:27:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499563377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:09,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-08 18:27:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712055007] [2024-11-08 18:27:09,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:09,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:27:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:09,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:27:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=495, Unknown=24, NotChecked=46, Total=650 [2024-11-08 18:27:09,687 INFO L87 Difference]: Start difference. First operand 920 states and 1068 transitions. Second operand has 21 states, 18 states have (on average 8.555555555555555) internal successors, (154), 20 states have internal predecessors, (154), 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:27:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:11,890 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2024-11-08 18:27:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:27:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.555555555555555) internal successors, (154), 20 states have internal predecessors, (154), 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:27:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:11,893 INFO L225 Difference]: With dead ends: 922 [2024-11-08 18:27:11,893 INFO L226 Difference]: Without dead ends: 922 [2024-11-08 18:27:11,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=768, Unknown=26, NotChecked=58, Total=992 [2024-11-08 18:27:11,894 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 699 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 3258 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 3844 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:11,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 3844 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3258 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 18:27:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-08 18:27:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 910. [2024-11-08 18:27:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 681 states have (on average 1.5433186490455213) internal successors, (1051), 904 states have internal predecessors, (1051), 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:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1057 transitions. [2024-11-08 18:27:11,909 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1057 transitions. Word has length 97 [2024-11-08 18:27:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1057 transitions. [2024-11-08 18:27:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.555555555555555) internal successors, (154), 20 states have internal predecessors, (154), 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:27:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1057 transitions. [2024-11-08 18:27:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:27:11,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:11,911 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:27:11,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:27:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 18:27:12,116 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1266948618, now seen corresponding path program 1 times [2024-11-08 18:27:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416963590] [2024-11-08 18:27:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:12,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:12,854 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:27:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416963590] [2024-11-08 18:27:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416963590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:12,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:12,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:27:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480880355] [2024-11-08 18:27:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:12,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:27:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:12,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:27:12,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:27:12,856 INFO L87 Difference]: Start difference. First operand 910 states and 1057 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 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:27:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:14,439 INFO L93 Difference]: Finished difference Result 926 states and 1076 transitions. [2024-11-08 18:27:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:27:14,439 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 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:27:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:14,442 INFO L225 Difference]: With dead ends: 926 [2024-11-08 18:27:14,442 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 18:27:14,442 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:27:14,443 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 735 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:14,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 4310 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2754 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 18:27:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 18:27:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 922. [2024-11-08 18:27:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 692 states have (on average 1.5375722543352601) internal successors, (1064), 915 states have internal predecessors, (1064), 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:27:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1071 transitions. [2024-11-08 18:27:14,458 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1071 transitions. Word has length 99 [2024-11-08 18:27:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:14,458 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1071 transitions. [2024-11-08 18:27:14,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 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:27:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1071 transitions. [2024-11-08 18:27:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:27:14,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:14,460 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:27:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 18:27:14,460 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1266948619, now seen corresponding path program 1 times [2024-11-08 18:27:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:14,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344955583] [2024-11-08 18:27:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:15,511 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:27:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:15,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344955583] [2024-11-08 18:27:15,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344955583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:15,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:15,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:27:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026627789] [2024-11-08 18:27:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:27:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:27:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:27:15,514 INFO L87 Difference]: Start difference. First operand 922 states and 1071 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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:27:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:17,328 INFO L93 Difference]: Finished difference Result 925 states and 1075 transitions. [2024-11-08 18:27:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:27:17,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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:27:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:17,331 INFO L225 Difference]: With dead ends: 925 [2024-11-08 18:27:17,331 INFO L226 Difference]: Without dead ends: 925 [2024-11-08 18:27:17,331 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:27:17,332 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 730 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3430 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:17,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3430 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:27:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-08 18:27:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2024-11-08 18:27:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 692 states have (on average 1.5361271676300579) internal successors, (1063), 915 states have internal predecessors, (1063), 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:27:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1070 transitions. [2024-11-08 18:27:17,344 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1070 transitions. Word has length 99 [2024-11-08 18:27:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:17,344 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1070 transitions. [2024-11-08 18:27:17,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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:27:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1070 transitions. [2024-11-08 18:27:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:27:17,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:17,346 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:27:17,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 18:27:17,346 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:17,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1623211805, now seen corresponding path program 1 times [2024-11-08 18:27:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790109030] [2024-11-08 18:27:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:18,126 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:27:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790109030] [2024-11-08 18:27:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790109030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024309690] [2024-11-08 18:27:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:18,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:18,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:18,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:27:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:18,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 18:27:18,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:18,455 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:27:18,590 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:27:18,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:27:18,621 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:18,711 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:18,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:18,880 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:18,994 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:18,994 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:19,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:19,069 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:19,088 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:19,122 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:27:19,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:19,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1566) |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:19,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (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~mem56#1.base| v_ArrVal_1565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:19,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (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_1565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:19,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (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~mem54#1.base| v_ArrVal_1569))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1565)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024309690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:19,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-08 18:27:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763773440] [2024-11-08 18:27:19,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:19,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 18:27:19,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 18:27:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=509, Unknown=10, NotChecked=196, Total=812 [2024-11-08 18:27:19,221 INFO L87 Difference]: Start difference. First operand 922 states and 1070 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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:27:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:22,114 INFO L93 Difference]: Finished difference Result 924 states and 1074 transitions. [2024-11-08 18:27:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:27:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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:27:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:22,116 INFO L225 Difference]: With dead ends: 924 [2024-11-08 18:27:22,116 INFO L226 Difference]: Without dead ends: 924 [2024-11-08 18:27:22,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=693, Unknown=10, NotChecked=228, Total=1056 [2024-11-08 18:27:22,118 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 690 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 4597 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 7196 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:22,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 7196 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4597 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 18:27:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-08 18:27:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-08 18:27:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 692 states have (on average 1.5346820809248556) internal successors, (1062), 914 states have internal predecessors, (1062), 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:27:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1069 transitions. [2024-11-08 18:27:22,132 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1069 transitions. Word has length 100 [2024-11-08 18:27:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:22,132 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1069 transitions. [2024-11-08 18:27:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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:27:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1069 transitions. [2024-11-08 18:27:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:27:22,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:22,134 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:27:22,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:27:22,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-08 18:27:22,334 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:22,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:22,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1623211806, now seen corresponding path program 1 times [2024-11-08 18:27:22,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:22,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286394812] [2024-11-08 18:27:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:22,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:23,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:23,569 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:27:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286394812] [2024-11-08 18:27:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286394812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154916971] [2024-11-08 18:27:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:23,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:23,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:27:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:23,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 18:27:23,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:23,881 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:27:24,004 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:24,012 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:27:24,012 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:24,053 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:24,064 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:24,160 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:24,168 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:27:24,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:24,302 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:27:24,306 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:27:24,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:24,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 18:27:24,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 18:27:24,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:24,492 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:27:24,500 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:27:24,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:27:24,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-08 18:27:24,604 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:27:24,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:24,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1739 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1739))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1740))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse0 .cse2 v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1739 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1739))) (or (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-08 18:27:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154916971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:25,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-08 18:27:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326140333] [2024-11-08 18:27:25,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 18:27:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 18:27:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=737, Unknown=23, NotChecked=56, Total=930 [2024-11-08 18:27:25,259 INFO L87 Difference]: Start difference. First operand 921 states and 1069 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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:27:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:28,468 INFO L93 Difference]: Finished difference Result 923 states and 1073 transitions. [2024-11-08 18:27:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:27:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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:27:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:28,470 INFO L225 Difference]: With dead ends: 923 [2024-11-08 18:27:28,470 INFO L226 Difference]: Without dead ends: 923 [2024-11-08 18:27:28,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=1121, Unknown=24, NotChecked=70, Total=1406 [2024-11-08 18:27:28,471 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 698 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 4995 SdHoareTripleChecker+Invalid, 4492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:28,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 4995 Invalid, 4492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4475 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 18:27:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-08 18:27:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 908. [2024-11-08 18:27:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 681 states have (on average 1.540381791483113) internal successors, (1049), 902 states have internal predecessors, (1049), 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:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1055 transitions. [2024-11-08 18:27:28,485 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1055 transitions. Word has length 100 [2024-11-08 18:27:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:28,485 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1055 transitions. [2024-11-08 18:27:28,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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:27:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1055 transitions. [2024-11-08 18:27:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:27:28,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:28,487 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] [2024-11-08 18:27:28,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:27:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 18:27:28,688 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -505671932, now seen corresponding path program 1 times [2024-11-08 18:27:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917739998] [2024-11-08 18:27:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:29,388 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:27:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917739998] [2024-11-08 18:27:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917739998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:27:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178177480] [2024-11-08 18:27:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:27:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:27:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:27:29,391 INFO L87 Difference]: Start difference. First operand 908 states and 1055 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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:27:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:31,018 INFO L93 Difference]: Finished difference Result 927 states and 1077 transitions. [2024-11-08 18:27:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:27:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2024-11-08 18:27:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:31,020 INFO L225 Difference]: With dead ends: 927 [2024-11-08 18:27:31,020 INFO L226 Difference]: Without dead ends: 927 [2024-11-08 18:27:31,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:27:31,021 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 737 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:31,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4355 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 18:27:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-08 18:27:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 923. [2024-11-08 18:27:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 695 states have (on average 1.5323741007194245) internal successors, (1065), 916 states have internal predecessors, (1065), 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:27:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1072 transitions. [2024-11-08 18:27:31,034 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1072 transitions. Word has length 102 [2024-11-08 18:27:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1072 transitions. [2024-11-08 18:27:31,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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:27:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1072 transitions. [2024-11-08 18:27:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:27:31,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:31,036 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] [2024-11-08 18:27:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 18:27:31,036 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -505671931, now seen corresponding path program 1 times [2024-11-08 18:27:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587960094] [2024-11-08 18:27:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:32,258 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:27:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587960094] [2024-11-08 18:27:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587960094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:32,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:27:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681088677] [2024-11-08 18:27:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:32,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:27:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:27:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:27:32,262 INFO L87 Difference]: Start difference. First operand 923 states and 1072 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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:27:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:34,527 INFO L93 Difference]: Finished difference Result 926 states and 1076 transitions. [2024-11-08 18:27:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:27:34,528 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2024-11-08 18:27:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:34,530 INFO L225 Difference]: With dead ends: 926 [2024-11-08 18:27:34,530 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 18:27:34,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:27:34,531 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 730 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3363 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:34,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3363 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 18:27:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 18:27:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2024-11-08 18:27:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 695 states have (on average 1.530935251798561) internal successors, (1064), 916 states have internal predecessors, (1064), 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:27:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1071 transitions. [2024-11-08 18:27:34,542 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1071 transitions. Word has length 102 [2024-11-08 18:27:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:34,543 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1071 transitions. [2024-11-08 18:27:34,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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:27:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1071 transitions. [2024-11-08 18:27:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:27:34,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:34,544 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:27:34,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 18:27:34,544 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:34,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 66743569, now seen corresponding path program 1 times [2024-11-08 18:27:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:34,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636788901] [2024-11-08 18:27:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,406 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:27:35,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:35,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636788901] [2024-11-08 18:27:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636788901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:35,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164345514] [2024-11-08 18:27:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:35,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:35,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:35,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:35,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:27:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 18:27:35,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:35,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:27:35,913 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:27:35,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:27:35,945 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:36,045 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:36,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:36,204 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:36,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:36,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 18:27:36,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:36,379 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:36,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:36,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 18:27:36,461 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:36,498 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:27:36,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:36,507 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2085 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2085) |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:36,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (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~mem57#1.base| v_ArrVal_2084))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:36,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (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~mem56#1.base| v_ArrVal_2083))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2084)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:36,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2083))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2084)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:36,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= (select |c_#valid| (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~mem54#1.base| v_ArrVal_2088))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2083)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2084)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-08 18:27:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164345514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:36,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-08 18:27:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273487575] [2024-11-08 18:27:36,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 18:27:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 18:27:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=636, Unknown=16, NotChecked=280, Total=1056 [2024-11-08 18:27:36,682 INFO L87 Difference]: Start difference. First operand 923 states and 1071 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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:27:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:39,100 INFO L93 Difference]: Finished difference Result 925 states and 1075 transitions. [2024-11-08 18:27:39,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:27:39,101 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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 103 [2024-11-08 18:27:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:39,102 INFO L225 Difference]: With dead ends: 925 [2024-11-08 18:27:39,102 INFO L226 Difference]: Without dead ends: 925 [2024-11-08 18:27:39,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=843, Unknown=16, NotChecked=320, Total=1332 [2024-11-08 18:27:39,103 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 685 mSDsluCounter, 4796 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:39,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 5286 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:27:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-08 18:27:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2024-11-08 18:27:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 695 states have (on average 1.5294964028776978) internal successors, (1063), 915 states have internal predecessors, (1063), 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:27:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1070 transitions. [2024-11-08 18:27:39,125 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1070 transitions. Word has length 103 [2024-11-08 18:27:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:39,125 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1070 transitions. [2024-11-08 18:27:39,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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:27:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1070 transitions. [2024-11-08 18:27:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:27:39,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:39,128 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:27:39,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 18:27:39,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-08 18:27:39,333 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 66743570, now seen corresponding path program 1 times [2024-11-08 18:27:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378244570] [2024-11-08 18:27:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:40,450 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:27:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378244570] [2024-11-08 18:27:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378244570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502700154] [2024-11-08 18:27:40,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:40,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:27:40,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:40,452 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:27:40,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:27:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:40,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 18:27:40,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:27:40,801 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:27:40,930 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:27:40,931 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,940 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:27:40,949 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:27:40,956 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:41,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 18:27:41,038 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:27:41,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:41,156 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:27:41,162 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:27:41,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:41,246 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:27:41,251 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:27:41,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:41,330 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:27:41,339 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:27:41,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:27:41,423 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:27:41,428 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:27:41,451 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:41,459 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:27:41,462 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:27:41,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:27:41,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2272))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2273) .cse0 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2273) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-08 18:27:41,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2271))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2270) .cse0 v_ArrVal_2273) (select (select (store .cse1 .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2274))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2271))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2272))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2270) .cse3 v_ArrVal_2273) .cse4 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-08 18:27:43,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2280 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2280))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2271))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2281) .cse0 v_ArrVal_2270) .cse1 v_ArrVal_2273) (select (select (store .cse2 .cse1 v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2274))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2280 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2280))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2271))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2272))) (let ((.cse7 (select (select .cse8 |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~mem54#1.base| v_ArrVal_2281) .cse5 v_ArrVal_2270) .cse6 v_ArrVal_2273) .cse7 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-08 18:27:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502700154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:27:43,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:27:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2024-11-08 18:27:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405699576] [2024-11-08 18:27:43,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:27:43,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:27:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:43,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:27:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=599, Unknown=44, NotChecked=162, Total=930 [2024-11-08 18:27:43,525 INFO L87 Difference]: Start difference. First operand 922 states and 1070 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:48,083 INFO L93 Difference]: Finished difference Result 924 states and 1074 transitions. [2024-11-08 18:27:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:27:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-08 18:27:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:48,085 INFO L225 Difference]: With dead ends: 924 [2024-11-08 18:27:48,086 INFO L226 Difference]: Without dead ends: 924 [2024-11-08 18:27:48,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=206, Invalid=1020, Unknown=46, NotChecked=210, Total=1482 [2024-11-08 18:27:48,087 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 693 mSDsluCounter, 3737 mSDsCounter, 0 mSdLazyCounter, 3663 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:48,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 4230 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3663 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 18:27:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-08 18:27:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 906. [2024-11-08 18:27:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 681 states have (on average 1.5374449339207048) internal successors, (1047), 900 states have internal predecessors, (1047), 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:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1053 transitions. [2024-11-08 18:27:48,099 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1053 transitions. Word has length 103 [2024-11-08 18:27:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:48,099 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1053 transitions. [2024-11-08 18:27:48,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:27:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1053 transitions. [2024-11-08 18:27:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:27:48,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:48,100 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:27:48,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 18:27:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 18:27:48,301 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1755973062, now seen corresponding path program 1 times [2024-11-08 18:27:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012565282] [2024-11-08 18:27:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:49,502 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:27:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012565282] [2024-11-08 18:27:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012565282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:27:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2411082] [2024-11-08 18:27:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:49,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:27:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:27:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:27:49,505 INFO L87 Difference]: Start difference. First operand 906 states and 1053 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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:27:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:52,877 INFO L93 Difference]: Finished difference Result 929 states and 1079 transitions. [2024-11-08 18:27:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:27:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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:27:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:52,882 INFO L225 Difference]: With dead ends: 929 [2024-11-08 18:27:52,882 INFO L226 Difference]: Without dead ends: 929 [2024-11-08 18:27:52,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:27:52,883 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 740 mSDsluCounter, 4313 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 4803 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:52,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 4803 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 18:27:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-08 18:27:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 925. [2024-11-08 18:27:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 699 states have (on average 1.5264663805436338) internal successors, (1067), 918 states have internal predecessors, (1067), 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:27:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1074 transitions. [2024-11-08 18:27:52,903 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1074 transitions. Word has length 106 [2024-11-08 18:27:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:52,904 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1074 transitions. [2024-11-08 18:27:52,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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:27:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1074 transitions. [2024-11-08 18:27:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:27:52,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:52,905 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:27:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 18:27:52,906 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:27:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1755973063, now seen corresponding path program 1 times [2024-11-08 18:27:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241207896] [2024-11-08 18:27:52,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:27:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:27:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241207896] [2024-11-08 18:27:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241207896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:54,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:27:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005946816] [2024-11-08 18:27:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:54,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:27:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:27:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:27:54,580 INFO L87 Difference]: Start difference. First operand 925 states and 1074 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 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:28:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:00,020 INFO L93 Difference]: Finished difference Result 928 states and 1078 transitions. [2024-11-08 18:28:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:28:00,021 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 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:28:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:00,022 INFO L225 Difference]: With dead ends: 928 [2024-11-08 18:28:00,022 INFO L226 Difference]: Without dead ends: 928 [2024-11-08 18:28:00,023 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:28:00,023 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 735 mSDsluCounter, 4537 mSDsCounter, 0 mSdLazyCounter, 4368 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 5028 SdHoareTripleChecker+Invalid, 4386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:00,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 5028 Invalid, 4386 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 4368 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 18:28:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-08 18:28:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 925. [2024-11-08 18:28:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 699 states have (on average 1.5250357653791131) internal successors, (1066), 918 states have internal predecessors, (1066), 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:28:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2024-11-08 18:28:00,034 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 106 [2024-11-08 18:28:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:00,034 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2024-11-08 18:28:00,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 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:28:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2024-11-08 18:28:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:28:00,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:00,036 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:28:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 18:28:00,036 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:28:00,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2032178515, now seen corresponding path program 1 times [2024-11-08 18:28:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41633131] [2024-11-08 18:28:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:28:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,202 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:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41633131] [2024-11-08 18:28:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41633131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:28:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900520238] [2024-11-08 18:28:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:01,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:01,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:01,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:28:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 18:28:01,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:01,608 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:01,835 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:28:01,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:28:01,886 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,066 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:02,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,351 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:02,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,545 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:02,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,690 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:02,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,830 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:02,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:02,938 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:02,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 18:28:03,113 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-08 18:28:03,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-08 18:28:03,124 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:03,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:28:04,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900520238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:28:04,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:28:04,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-08 18:28:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573062374] [2024-11-08 18:28:04,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:28:04,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 18:28:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 18:28:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1169, Unknown=46, NotChecked=0, Total=1406 [2024-11-08 18:28:04,492 INFO L87 Difference]: Start difference. First operand 925 states and 1073 transitions. Second operand has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 states have internal predecessors, (174), 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:28:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:10,035 INFO L93 Difference]: Finished difference Result 927 states and 1077 transitions. [2024-11-08 18:28:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:28:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 states have internal predecessors, (174), 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:28:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:10,037 INFO L225 Difference]: With dead ends: 927 [2024-11-08 18:28:10,038 INFO L226 Difference]: Without dead ends: 927 [2024-11-08 18:28:10,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=223, Invalid=1453, Unknown=46, NotChecked=0, Total=1722 [2024-11-08 18:28:10,039 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 678 mSDsluCounter, 6192 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 6681 SdHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:10,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 6681 Invalid, 4315 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 18:28:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-08 18:28:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 924. [2024-11-08 18:28:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 699 states have (on average 1.5236051502145922) internal successors, (1065), 917 states have internal predecessors, (1065), 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:28:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1072 transitions. [2024-11-08 18:28:10,054 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1072 transitions. Word has length 107 [2024-11-08 18:28:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:10,055 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1072 transitions. [2024-11-08 18:28:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 states have internal predecessors, (174), 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:28:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1072 transitions. [2024-11-08 18:28:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:28:10,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:10,057 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:28:10,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 18:28:10,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:10,258 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:28:10,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:10,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2032178516, now seen corresponding path program 1 times [2024-11-08 18:28:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753170002] [2024-11-08 18:28:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:10,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:11,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:28:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:12,006 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:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753170002] [2024-11-08 18:28:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753170002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:28:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337105784] [2024-11-08 18:28:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:12,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:28:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:28:12,009 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:28:12,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 18:28:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:12,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 18:28:12,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:28:12,406 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:12,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 18:28:12,664 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:28:12,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:28:12,764 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:12,779 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:12,998 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:28:13,004 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:28:13,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:13,357 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:28:13,367 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:28:13,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:13,569 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:28:13,576 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:28:13,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:13,747 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:28:13,756 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:28:13,914 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:13,914 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:28:13,920 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:28:14,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:28:14,079 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:28:14,088 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:28:14,125 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:28:14,133 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:28:14,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:28:14,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 18:28:14,266 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 18:28:14,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 18:28:14,343 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:14,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:28:15,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2862 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2858))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2859) .cse0 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2862) (select (select (store .cse2 .cse0 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2859 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2859) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))))) is different from false [2024-11-08 18:28:16,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2859 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2855))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2856))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2854) .cse0 v_ArrVal_2857) .cse1 v_ArrVal_2859) (select (select (store .cse2 .cse1 v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2861))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (v_ArrVal_2856 (Array Int Int)) (v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2862 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2855))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2856))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2858))) (let ((.cse7 (select (select .cse8 |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~mem56#1.base| v_ArrVal_2854) .cse5 v_ArrVal_2857) .cse6 v_ArrVal_2859) .cse7 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2862) (select (select (store .cse8 .cse7 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-08 18:28:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337105784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:28:29,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:28:29,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-08 18:28:29,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847197002] [2024-11-08 18:28:29,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:28:29,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 18:28:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 18:28:29,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1351, Unknown=40, NotChecked=154, Total=1722 [2024-11-08 18:28:29,534 INFO L87 Difference]: Start difference. First operand 924 states and 1072 transitions. Second operand has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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:29:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:04,031 INFO L93 Difference]: Finished difference Result 926 states and 1076 transitions. [2024-11-08 18:29:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:29:04,032 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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:29:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:04,034 INFO L225 Difference]: With dead ends: 926 [2024-11-08 18:29:04,034 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 18:29:04,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=309, Invalid=2209, Unknown=40, NotChecked=198, Total=2756 [2024-11-08 18:29:04,036 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 691 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 5129 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 5819 SdHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:04,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 5819 Invalid, 5153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5129 Invalid, 0 Unknown, 0 Unchecked, 31.5s Time] [2024-11-08 18:29:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 18:29:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 904. [2024-11-08 18:29:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 681 states have (on average 1.5345080763582966) internal successors, (1045), 898 states have internal predecessors, (1045), 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:29:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1051 transitions. [2024-11-08 18:29:04,048 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1051 transitions. Word has length 107 [2024-11-08 18:29:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:04,048 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1051 transitions. [2024-11-08 18:29:04,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 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:29:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1051 transitions. [2024-11-08 18:29:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:29:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:04,050 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:29:04,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 18:29:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:29:04,251 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:29:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash -507513865, now seen corresponding path program 1 times [2024-11-08 18:29:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610913728] [2024-11-08 18:29:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:29:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,350 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:29:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610913728] [2024-11-08 18:29:05,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610913728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:05,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:29:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098230446] [2024-11-08 18:29:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:05,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:29:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:29:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:29:05,353 INFO L87 Difference]: Start difference. First operand 904 states and 1051 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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:29:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:11,625 INFO L93 Difference]: Finished difference Result 909 states and 1059 transitions. [2024-11-08 18:29:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:29:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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:29:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:11,628 INFO L225 Difference]: With dead ends: 909 [2024-11-08 18:29:11,629 INFO L226 Difference]: Without dead ends: 909 [2024-11-08 18:29:11,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:29:11,630 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 6 mSDsluCounter, 2881 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:11,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3655 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 18:29:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-08 18:29:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 903. [2024-11-08 18:29:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 681 states have (on average 1.5330396475770924) internal successors, (1044), 897 states have internal predecessors, (1044), 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:29:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1050 transitions. [2024-11-08 18:29:11,648 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1050 transitions. Word has length 109 [2024-11-08 18:29:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:11,649 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1050 transitions. [2024-11-08 18:29:11,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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:29:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1050 transitions. [2024-11-08 18:29:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:29:11,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:11,651 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:29:11,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 18:29:11,652 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:29:11,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -507513864, now seen corresponding path program 1 times [2024-11-08 18:29:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054546517] [2024-11-08 18:29:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:29:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:16,045 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:29:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:16,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054546517] [2024-11-08 18:29:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054546517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:29:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861084240] [2024-11-08 18:29:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:16,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:29:16,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:16,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:29:16,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:29:16,048 INFO L87 Difference]: Start difference. First operand 903 states and 1050 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 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:29:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:45,473 INFO L93 Difference]: Finished difference Result 928 states and 1078 transitions. [2024-11-08 18:29:45,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:29:45,474 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 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:29:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:45,477 INFO L225 Difference]: With dead ends: 928 [2024-11-08 18:29:45,478 INFO L226 Difference]: Without dead ends: 928 [2024-11-08 18:29:45,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-08 18:29:45,479 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 712 mSDsluCounter, 4847 mSDsCounter, 0 mSdLazyCounter, 4883 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 5337 SdHoareTripleChecker+Invalid, 4897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:45,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 5337 Invalid, 4897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 4883 Invalid, 0 Unknown, 0 Unchecked, 27.6s Time] [2024-11-08 18:29:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-08 18:29:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 925. [2024-11-08 18:29:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 702 states have (on average 1.5185185185185186) internal successors, (1066), 918 states have internal predecessors, (1066), 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:29:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2024-11-08 18:29:45,498 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 109 [2024-11-08 18:29:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2024-11-08 18:29:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 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:29:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2024-11-08 18:29:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:29:45,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:45,501 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:29:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 18:29:45,501 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:29:45,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1228202677, now seen corresponding path program 1 times [2024-11-08 18:29:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910523793] [2024-11-08 18:29:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:29:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:50,496 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:29:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910523793] [2024-11-08 18:29:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910523793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:29:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288720376] [2024-11-08 18:29:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:29:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:29:50,498 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:29:50,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 18:29:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:50,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 18:29:50,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:29:50,978 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:51,928 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:29:52,060 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:29:52,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 18:29:52,344 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:52,387 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:53,425 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:53,441 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:54,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:54,543 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:29:54,564 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:55,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:55,468 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:29:55,495 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:56,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:56,062 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:29:56,079 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:56,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:56,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 73 treesize of output 66 [2024-11-08 18:29:56,908 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:57,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:57,543 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:29:57,559 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:58,275 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-08 18:29:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-08 18:29:58,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 18:29:58,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:29:58,736 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:58,753 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:59,082 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:59,111 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:59,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:29:59,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:29:59,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3273 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3273) |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~mem60#1.base| v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3273 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 18:30:01,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3270))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3269) .cse0 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse2 .cse0 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3269) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:30:03,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3266))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3265) .cse0 v_ArrVal_3267) .cse1 v_ArrVal_3269) (select (select (store .cse2 .cse1 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3273))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3266))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3268))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3270))) (let ((.cse7 (select (select .cse8 |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~mem57#1.base| v_ArrVal_3265) .cse5 v_ArrVal_3267) .cse6 v_ArrVal_3269) .cse7 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse8 .cse7 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-08 18:30:03,408 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_ArrVal_3273 (Array Int Int)) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3266))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3268))) (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_3265) .cse1 v_ArrVal_3267) .cse2 v_ArrVal_3269) (select (select (store .cse3 .cse2 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3273))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3266))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3268))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3270))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3265) .cse6 v_ArrVal_3267) .cse7 v_ArrVal_3269) .cse8 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse9 .cse8 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-08 18:30:03,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3263))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3266))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3268))) (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~mem56#1.base| v_ArrVal_3264) .cse0 v_ArrVal_3265) .cse1 v_ArrVal_3267) .cse2 v_ArrVal_3269) (select (select (store .cse3 .cse2 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3273))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 40))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3263))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3266))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3268))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3270))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3264) .cse7 v_ArrVal_3265) .cse8 v_ArrVal_3267) .cse9 v_ArrVal_3269) .cse10 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse11 .cse10 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-08 18:30:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288720376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:30:39,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:30:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2024-11-08 18:30:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476288544] [2024-11-08 18:30:39,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:30:39,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 18:30:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 18:30:39,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1469, Unknown=41, NotChecked=420, Total=2162 [2024-11-08 18:30:39,423 INFO L87 Difference]: Start difference. First operand 925 states and 1073 transitions. Second operand has 33 states, 30 states have (on average 6.0) internal successors, (180), 32 states have internal predecessors, (180), 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:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:35,316 INFO L93 Difference]: Finished difference Result 927 states and 1077 transitions. [2024-11-08 18:31:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:31:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.0) internal successors, (180), 32 states have internal predecessors, (180), 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:31:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:35,320 INFO L225 Difference]: With dead ends: 927 [2024-11-08 18:31:35,320 INFO L226 Difference]: Without dead ends: 927 [2024-11-08 18:31:35,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=386, Invalid=2455, Unknown=41, NotChecked=540, Total=3422 [2024-11-08 18:31:35,323 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 680 mSDsluCounter, 5794 mSDsCounter, 0 mSdLazyCounter, 5412 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 6282 SdHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:35,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 6282 Invalid, 5432 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5412 Invalid, 0 Unknown, 0 Unchecked, 51.3s Time] [2024-11-08 18:31:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-08 18:31:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 902. [2024-11-08 18:31:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 681 states have (on average 1.5315712187958883) internal successors, (1043), 896 states have internal predecessors, (1043), 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:31:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1049 transitions. [2024-11-08 18:31:35,341 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1049 transitions. Word has length 110 [2024-11-08 18:31:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:35,341 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1049 transitions. [2024-11-08 18:31:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.0) internal successors, (180), 32 states have internal predecessors, (180), 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:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1049 transitions. [2024-11-08 18:31:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:31:35,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:35,343 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:31:35,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 18:31:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:31:35,545 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:31:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1060001971, now seen corresponding path program 1 times [2024-11-08 18:31:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153956416] [2024-11-08 18:31:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:31:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:31:39,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:39,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153956416] [2024-11-08 18:31:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153956416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:39,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:39,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:31:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756146724] [2024-11-08 18:31:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:39,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:31:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:31:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:31:39,633 INFO L87 Difference]: Start difference. First operand 902 states and 1049 transitions. Second operand has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 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:32:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:17,045 INFO L93 Difference]: Finished difference Result 953 states and 1105 transitions. [2024-11-08 18:32:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:32:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 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:32:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:17,047 INFO L225 Difference]: With dead ends: 953 [2024-11-08 18:32:17,047 INFO L226 Difference]: Without dead ends: 953 [2024-11-08 18:32:17,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:32:17,048 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 785 mSDsluCounter, 6241 mSDsCounter, 0 mSdLazyCounter, 4241 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 6731 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:17,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 6731 Invalid, 4262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4241 Invalid, 0 Unknown, 0 Unchecked, 35.6s Time] [2024-11-08 18:32:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-08 18:32:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2024-11-08 18:32:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 705 states have (on average 1.5163120567375887) internal successors, (1069), 920 states have internal predecessors, (1069), 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:32:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1076 transitions. [2024-11-08 18:32:17,062 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1076 transitions. Word has length 112 [2024-11-08 18:32:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:17,062 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1076 transitions. [2024-11-08 18:32:17,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 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:32:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1076 transitions. [2024-11-08 18:32:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:32:17,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:17,064 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:32:17,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 18:32:17,064 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:32:17,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1060001970, now seen corresponding path program 1 times [2024-11-08 18:32:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:32:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083812919] [2024-11-08 18:32:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:32:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:21,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:32:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:21,660 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:32:21,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:32:21,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083812919] [2024-11-08 18:32:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083812919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:32:21,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:32:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:32:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790407629] [2024-11-08 18:32:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:32:21,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:32:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:32:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:32:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:32:21,663 INFO L87 Difference]: Start difference. First operand 927 states and 1076 transitions. Second operand has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 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:32:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:57,961 INFO L93 Difference]: Finished difference Result 952 states and 1104 transitions. [2024-11-08 18:32:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:32:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 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:32:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:57,964 INFO L225 Difference]: With dead ends: 952 [2024-11-08 18:32:57,964 INFO L226 Difference]: Without dead ends: 952 [2024-11-08 18:32:57,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:32:57,965 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 796 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:57,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 5521 Invalid, 3898 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 34.3s Time] [2024-11-08 18:32:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-11-08 18:32:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 927. [2024-11-08 18:32:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 705 states have (on average 1.5148936170212766) internal successors, (1068), 920 states have internal predecessors, (1068), 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:32:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1075 transitions. [2024-11-08 18:32:57,976 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1075 transitions. Word has length 112 [2024-11-08 18:32:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1075 transitions. [2024-11-08 18:32:57,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 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:32:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1075 transitions. [2024-11-08 18:32:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:32:57,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:57,978 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:32:57,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 18:32:57,978 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:32:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -558917350, now seen corresponding path program 1 times [2024-11-08 18:32:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:32:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65628524] [2024-11-08 18:32:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:32:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:33:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:01,702 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:33:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65628524] [2024-11-08 18:33:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65628524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:33:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638490330] [2024-11-08 18:33:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:01,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:01,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:01,705 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:33:01,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 18:33:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 18:33:02,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:02,172 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:33:03,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:33:03,669 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:33:03,709 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:04,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:04,124 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:33:04,629 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:04,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 31 treesize of output 32 [2024-11-08 18:33:05,128 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:05,128 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:33:05,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:05,633 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:33:06,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:06,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 18:33:06,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:06,367 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:33:06,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:33:06,945 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:33:07,039 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:33:07,058 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:33:07,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:33:07,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3698 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3698) |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:33:07,188 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3698 (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_3698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-08 18:33:07,301 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 18:33:07,301 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:33:07,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem60#1.base| (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~mem60#1.base| v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-08 18:33:07,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3696)) (.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_3697))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-08 18:33:08,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (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~mem58#1.base| v_ArrVal_3695))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:33:08,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (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_3695))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:33:09,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (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_3694))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:33:09,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3693))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3694)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:33:09,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3693))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3694)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3696)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3697))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-08 18:33:09,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int)) (v_ArrVal_3701 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3701))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3693)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3694)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-08 18:33:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638490330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:33:09,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:33:09,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 24 [2024-11-08 18:33:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962238651] [2024-11-08 18:33:09,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:33:09,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 18:33:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 18:33:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=642, Unknown=27, NotChecked=610, Total=1406 [2024-11-08 18:33:09,601 INFO L87 Difference]: Start difference. First operand 927 states and 1075 transitions. Second operand has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 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:33:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:52,345 INFO L93 Difference]: Finished difference Result 943 states and 1093 transitions. [2024-11-08 18:33:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:33:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 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 113 [2024-11-08 18:33:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:52,347 INFO L225 Difference]: With dead ends: 943 [2024-11-08 18:33:52,347 INFO L226 Difference]: Without dead ends: 943 [2024-11-08 18:33:52,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=234, Invalid=1261, Unknown=27, NotChecked=830, Total=2352 [2024-11-08 18:33:52,348 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 758 mSDsluCounter, 6717 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 7207 SdHoareTripleChecker+Invalid, 4563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:52,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 7207 Invalid, 4563 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 40.3s Time] [2024-11-08 18:33:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-08 18:33:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 926. [2024-11-08 18:33:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 705 states have (on average 1.5134751773049646) internal successors, (1067), 919 states have internal predecessors, (1067), 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:33:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1074 transitions. [2024-11-08 18:33:52,359 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1074 transitions. Word has length 113 [2024-11-08 18:33:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:52,360 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1074 transitions. [2024-11-08 18:33:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 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:33:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1074 transitions. [2024-11-08 18:33:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:33:52,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:52,361 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:33:52,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 18:33:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:52,562 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:33:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash -558917349, now seen corresponding path program 1 times [2024-11-08 18:33:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987209727] [2024-11-08 18:33:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:33:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:58,289 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:33:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987209727] [2024-11-08 18:33:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987209727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:33:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639725945] [2024-11-08 18:33:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:58,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:33:58,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:58,292 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:33:58,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 18:33:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:58,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 18:33:58,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:58,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 18:34:00,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:34:00,457 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:34:00,524 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:34:00,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 18:34:01,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:01,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 18:34:01,595 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:34:02,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:02,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 18:34:02,262 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:34:02,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:02,946 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:34:02,967 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:34:03,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:03,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 51 treesize of output 48 [2024-11-08 18:34:03,775 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:34:04,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:04,381 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:34:04,406 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:34:05,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:05,069 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:34:05,117 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:34:06,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:34:06,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:34:06,288 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:34:06,425 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:34:06,448 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:34:06,797 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:34:06,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:34:07,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3933 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-08 18:34:07,734 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_3933 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:34:07,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:34:07,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 84 [2024-11-08 18:34:08,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3931) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem60#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3930))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_prenex_44) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-08 18:34:08,276 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_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_44) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3931) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3930))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 18:34:08,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3929))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3928) .cse0 v_prenex_44) (select (select (store .cse1 .cse0 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3929))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3928) .cse3 v_ArrVal_3931) (select (select (store .cse4 .cse3 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3933))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3929))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_3930))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse7)))))) is different from false [2024-11-08 18:34:08,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3929))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3930))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3929))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3928) .cse5 v_prenex_44) (select (select (store .cse6 .cse5 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3929))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3928) .cse7 v_ArrVal_3931) (select (select (store .cse8 .cse7 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3933))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2024-11-08 18:34:08,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3927))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3929))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3926) .cse0 v_ArrVal_3928) .cse1 v_ArrVal_3931) (select (select (store .cse2 .cse1 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3933))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3927))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3929))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3926) .cse5 v_ArrVal_3928) .cse6 v_prenex_44) (select (select (store .cse7 .cse6 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_45))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3927))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3929)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3930))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-08 18:34:10,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3925))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3927))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3929))) (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~mem57#1.base| v_ArrVal_3924) .cse0 v_ArrVal_3926) .cse1 v_ArrVal_3928) .cse2 v_ArrVal_3931) (select (select (store .cse3 .cse2 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3933))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3925))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3927)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3929)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse7 (store .cse8 .cse9 v_ArrVal_3930))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse9)))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3925))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3927))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3929))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3924) .cse12 v_ArrVal_3926) .cse13 v_ArrVal_3928) .cse14 v_prenex_44) (select (select (store .cse15 .cse14 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_45))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) is different from false [2024-11-08 18:34:10,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3925))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3927))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3929))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3924) .cse1 v_ArrVal_3926) .cse2 v_ArrVal_3928) .cse3 v_prenex_44) (select (select (store .cse4 .cse3 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_45))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3925))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3927))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3929))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3924) .cse8 v_ArrVal_3926) .cse9 v_ArrVal_3928) .cse10 v_ArrVal_3931) (select (select (store .cse11 .cse10 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3933))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3925))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3927)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3929)))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse14 (select (select (let ((.cse15 (store .cse16 .cse14 v_ArrVal_3930))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) is different from false [2024-11-08 18:34:14,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3923))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3925))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3927))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3929))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3922) .cse0 v_ArrVal_3924) .cse1 v_ArrVal_3926) .cse2 v_ArrVal_3928) .cse3 v_prenex_44) (select (select (store .cse4 .cse3 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_45))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3923))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3925)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3927)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3929)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3930))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3923))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3925))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3927))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3929))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3922) .cse15 v_ArrVal_3924) .cse16 v_ArrVal_3926) .cse17 v_ArrVal_3928) .cse18 v_ArrVal_3931) (select (select (store .cse19 .cse18 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3933))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)))) is different from false [2024-11-08 18:34:19,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3923))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3925)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3927)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3929)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3930))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3923))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3925))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3927))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3929))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3922) .cse8 v_ArrVal_3924) .cse9 v_ArrVal_3926) .cse10 v_ArrVal_3928) .cse11 v_prenex_44) (select (select (store .cse12 .cse11 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3923))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3925))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3927))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3929))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3922) .cse16 v_ArrVal_3924) .cse17 v_ArrVal_3926) .cse18 v_ArrVal_3928) .cse19 v_ArrVal_3931) (select (select (store .cse20 .cse19 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3933))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2024-11-08 18:34:25,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3939))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3923)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3925)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3927)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3929)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3930))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3939))) (let ((.cse8 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse8 v_ArrVal_3923))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_3925))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3927))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3929))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3938) .cse8 v_ArrVal_3922) .cse9 v_ArrVal_3924) .cse10 v_ArrVal_3926) .cse11 v_ArrVal_3928) .cse12 v_ArrVal_3931) (select (select (store .cse13 .cse12 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3933))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3939))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse27 .cse18 v_ArrVal_3923))) (let ((.cse19 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse26 .cse19 v_ArrVal_3925))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse25 .cse20 v_ArrVal_3927))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_3929))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3938) .cse18 v_ArrVal_3922) .cse19 v_ArrVal_3924) .cse20 v_ArrVal_3926) .cse21 v_ArrVal_3928) .cse22 v_prenex_44) (select (select (store .cse23 .cse22 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_45))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 18:34:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639725945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:34:25,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:34:25,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 27 [2024-11-08 18:34:25,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668874632] [2024-11-08 18:34:25,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:34:25,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 18:34:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:34:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 18:34:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=823, Unknown=23, NotChecked=828, Total=1806 [2024-11-08 18:34:25,781 INFO L87 Difference]: Start difference. First operand 926 states and 1074 transitions. Second operand has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:35:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:21,417 INFO L93 Difference]: Finished difference Result 942 states and 1092 transitions. [2024-11-08 18:35:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:35:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-08 18:35:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:21,420 INFO L225 Difference]: With dead ends: 942 [2024-11-08 18:35:21,421 INFO L226 Difference]: Without dead ends: 942 [2024-11-08 18:35:21,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=244, Invalid=1585, Unknown=25, NotChecked=1116, Total=2970 [2024-11-08 18:35:21,422 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 767 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 7710 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:21,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 7710 Invalid, 5627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 52.2s Time] [2024-11-08 18:35:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-08 18:35:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 900. [2024-11-08 18:35:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 681 states have (on average 1.52863436123348) internal successors, (1041), 894 states have internal predecessors, (1041), 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:35:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1047 transitions. [2024-11-08 18:35:21,438 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1047 transitions. Word has length 113 [2024-11-08 18:35:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:21,438 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1047 transitions. [2024-11-08 18:35:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 18:35:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1047 transitions. [2024-11-08 18:35:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 18:35:21,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:21,440 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, 1] [2024-11-08 18:35:21,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 18:35:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:35:21,641 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:35:21,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1918469685, now seen corresponding path program 1 times [2024-11-08 18:35:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832014211] [2024-11-08 18:35:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:35:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:22,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:35:22,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:22,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832014211] [2024-11-08 18:35:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832014211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:22,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:35:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915306007] [2024-11-08 18:35:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:22,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:35:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:35:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:35:22,294 INFO L87 Difference]: Start difference. First operand 900 states and 1047 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:35:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:30,888 INFO L93 Difference]: Finished difference Result 919 states and 1069 transitions. [2024-11-08 18:35:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:35:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 115 [2024-11-08 18:35:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:30,890 INFO L225 Difference]: With dead ends: 919 [2024-11-08 18:35:30,891 INFO L226 Difference]: Without dead ends: 919 [2024-11-08 18:35:30,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:30,891 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 22 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:30,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2980 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 18:35:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-08 18:35:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 899. [2024-11-08 18:35:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 681 states have (on average 1.5271659324522762) internal successors, (1040), 893 states have internal predecessors, (1040), 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:35:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1046 transitions. [2024-11-08 18:35:30,901 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1046 transitions. Word has length 115 [2024-11-08 18:35:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:30,901 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1046 transitions. [2024-11-08 18:35:30,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:35:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1046 transitions. [2024-11-08 18:35:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 18:35:30,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:30,902 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, 1] [2024-11-08 18:35:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 18:35:30,902 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:35:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1918469684, now seen corresponding path program 1 times [2024-11-08 18:35:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686076121] [2024-11-08 18:35:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:35:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:31,566 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:35:31,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:31,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686076121] [2024-11-08 18:35:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686076121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:31,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:35:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718573744] [2024-11-08 18:35:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:31,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:35:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:35:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:35:31,568 INFO L87 Difference]: Start difference. First operand 899 states and 1046 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:35:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:40,359 INFO L93 Difference]: Finished difference Result 918 states and 1068 transitions. [2024-11-08 18:35:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:35:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 115 [2024-11-08 18:35:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:40,362 INFO L225 Difference]: With dead ends: 918 [2024-11-08 18:35:40,362 INFO L226 Difference]: Without dead ends: 918 [2024-11-08 18:35:40,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:35:40,363 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 21 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:40,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2960 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-08 18:35:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-08 18:35:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 898. [2024-11-08 18:35:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 681 states have (on average 1.525697503671072) internal successors, (1039), 892 states have internal predecessors, (1039), 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:35:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1045 transitions. [2024-11-08 18:35:40,378 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1045 transitions. Word has length 115 [2024-11-08 18:35:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:40,379 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1045 transitions. [2024-11-08 18:35:40,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:35:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1045 transitions. [2024-11-08 18:35:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 18:35:40,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:40,380 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, 1, 1] [2024-11-08 18:35:40,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 18:35:40,381 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:35:40,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash 656982609, now seen corresponding path program 1 times [2024-11-08 18:35:40,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:35:40,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626142275] [2024-11-08 18:35:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:40,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:35:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:35:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:46,212 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:35:46,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:35:46,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626142275] [2024-11-08 18:35:46,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626142275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:35:46,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:35:46,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:35:46,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182854040] [2024-11-08 18:35:46,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:35:46,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:35:46,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:35:46,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:35:46,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:35:46,215 INFO L87 Difference]: Start difference. First operand 898 states and 1045 transitions. Second operand has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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:36:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:27,162 INFO L93 Difference]: Finished difference Result 946 states and 1098 transitions. [2024-11-08 18:36:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:36:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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 116 [2024-11-08 18:36:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:27,164 INFO L225 Difference]: With dead ends: 946 [2024-11-08 18:36:27,164 INFO L226 Difference]: Without dead ends: 946 [2024-11-08 18:36:27,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 18:36:27,165 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 770 mSDsluCounter, 5800 mSDsCounter, 0 mSdLazyCounter, 4074 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 6296 SdHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:27,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 6296 Invalid, 4093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 4074 Invalid, 0 Unknown, 0 Unchecked, 38.0s Time] [2024-11-08 18:36:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-11-08 18:36:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 927. [2024-11-08 18:36:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 709 states have (on average 1.5063469675599437) internal successors, (1068), 920 states have internal predecessors, (1068), 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:36:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1077 transitions. [2024-11-08 18:36:27,178 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1077 transitions. Word has length 116 [2024-11-08 18:36:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:27,178 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1077 transitions. [2024-11-08 18:36:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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:36:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1077 transitions. [2024-11-08 18:36:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 18:36:27,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:27,180 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, 1, 1] [2024-11-08 18:36:27,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-08 18:36:27,181 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:36:27,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 656982610, now seen corresponding path program 1 times [2024-11-08 18:36:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:27,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644395777] [2024-11-08 18:36:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:33,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:36:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:34,132 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:36:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644395777] [2024-11-08 18:36:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644395777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:34,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:36:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260613902] [2024-11-08 18:36:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:36:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:36:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:36:34,135 INFO L87 Difference]: Start difference. First operand 927 states and 1077 transitions. Second operand has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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:37:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:37:28,011 INFO L93 Difference]: Finished difference Result 945 states and 1097 transitions. [2024-11-08 18:37:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:37:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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 116 [2024-11-08 18:37:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:37:28,015 INFO L225 Difference]: With dead ends: 945 [2024-11-08 18:37:28,015 INFO L226 Difference]: Without dead ends: 945 [2024-11-08 18:37:28,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 18:37:28,016 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 749 mSDsluCounter, 6183 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 6677 SdHoareTripleChecker+Invalid, 5264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:37:28,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 6677 Invalid, 5264 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 50.1s Time] [2024-11-08 18:37:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-08 18:37:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 927. [2024-11-08 18:37:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 708 states have (on average 1.5070621468926553) internal successors, (1067), 920 states have internal predecessors, (1067), 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:37:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1076 transitions. [2024-11-08 18:37:28,031 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1076 transitions. Word has length 116 [2024-11-08 18:37:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:37:28,031 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1076 transitions. [2024-11-08 18:37:28,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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:37:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1076 transitions. [2024-11-08 18:37:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:37:28,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:37:28,033 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, 1, 1, 1] [2024-11-08 18:37:28,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-08 18:37:28,033 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:37:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:37:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1575945630, now seen corresponding path program 1 times [2024-11-08 18:37:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:37:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566116333] [2024-11-08 18:37:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:37:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:37:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:37:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:34,887 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:37:34,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:37:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566116333] [2024-11-08 18:37:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566116333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827681612] [2024-11-08 18:37:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:37:34,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:37:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:37:34,890 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:37:34,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 18:37:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:37:35,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-08 18:37:35,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:37:35,399 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:37:36,843 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:37:36,844 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:37:37,163 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:37:37,184 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:37:38,170 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:37:38,171 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:37:38,191 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:37:38,710 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:37:38,710 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:37:38,755 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:37:39,277 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:37:39,278 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:37:39,317 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:37:39,854 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:37:39,854 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:37:39,875 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:37:40,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:37:40,451 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:37:40,472 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:37:41,025 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:37:41,641 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 18:37:41,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-08 18:37:41,665 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:37:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:37:42,889 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 18:37:42,889 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:37:42,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-08 18:37:43,153 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:37:43,652 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-08 18:37:43,653 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:37:43,672 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:37:43,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:37:43,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int)) (= (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~mem62#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|) v_ArrVal_4566)))) (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~mem62#1.base| v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1)) is different from false [2024-11-08 18:37:43,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (= (select |c_#valid| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 18:37:44,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4563)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (= (select |c_#valid| (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 18:37:44,131 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 446 treesize of output 300 [2024-11-08 18:37:44,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4563)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 18:37:44,326 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |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|) .cse1))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse5 (store (select |c_#memory_$Pointer$#1.base| .cse5) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-08 18:37:48,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4558))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-08 18:37:52,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4557)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_4558))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4556) .cse8 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-08 18:37:52,962 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4557))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4558))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4556) .cse9 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-08 18:37:53,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4555)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_4557))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4558))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4554) .cse8 v_ArrVal_4556) .cse9 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-08 18:37:53,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4555))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4557))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4558))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4554) .cse9 v_ArrVal_4556) .cse10 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-08 18:37:53,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4552 (Array Int Int)) (v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4553 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4553)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_4555))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4557))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4558))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4552) .cse8 v_ArrVal_4554) .cse9 v_ArrVal_4556) .cse10 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-08 18:37:53,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4552 (Array Int Int)) (v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4553 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4553))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4555))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4557))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4558))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4552) .cse9 v_ArrVal_4554) .cse10 v_ArrVal_4556) .cse11 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))) is different from false [2024-11-08 18:37:53,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4552 (Array Int Int)) (v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4553 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4572)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_4553))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4555))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4557))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4558))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4571) .cse8 v_ArrVal_4552) .cse9 v_ArrVal_4554) .cse10 v_ArrVal_4556) .cse11 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-08 18:37:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827681612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:37:53,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:37:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2024-11-08 18:37:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157649973] [2024-11-08 18:37:53,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:37:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 18:37:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:37:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 18:37:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1080, Unknown=20, NotChecked=1014, Total=2256 [2024-11-08 18:37:53,934 INFO L87 Difference]: Start difference. First operand 927 states and 1076 transitions. Second operand has 34 states, 31 states have (on average 6.096774193548387) internal successors, (189), 33 states have internal predecessors, (189), 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:38:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:38:57,318 INFO L93 Difference]: Finished difference Result 943 states and 1095 transitions. [2024-11-08 18:38:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:38:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 6.096774193548387) internal successors, (189), 33 states have internal predecessors, (189), 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 117 [2024-11-08 18:38:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:38:57,321 INFO L225 Difference]: With dead ends: 943 [2024-11-08 18:38:57,322 INFO L226 Difference]: Without dead ends: 943 [2024-11-08 18:38:57,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=261, Invalid=2123, Unknown=20, NotChecked=1378, Total=3782 [2024-11-08 18:38:57,323 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 711 mSDsluCounter, 9558 mSDsCounter, 0 mSdLazyCounter, 6350 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 10046 SdHoareTripleChecker+Invalid, 6372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:38:57,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 10046 Invalid, 6372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6350 Invalid, 0 Unknown, 0 Unchecked, 58.9s Time] [2024-11-08 18:38:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-08 18:38:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 926. [2024-11-08 18:38:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 708 states have (on average 1.5056497175141244) internal successors, (1066), 919 states have internal predecessors, (1066), 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:38:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1075 transitions. [2024-11-08 18:38:57,338 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1075 transitions. Word has length 117 [2024-11-08 18:38:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:38:57,338 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1075 transitions. [2024-11-08 18:38:57,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 6.096774193548387) internal successors, (189), 33 states have internal predecessors, (189), 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:38:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1075 transitions. [2024-11-08 18:38:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:38:57,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:38:57,340 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, 1, 1, 1] [2024-11-08 18:38:57,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 18:38:57,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-08 18:38:57,541 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:38:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:38:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1575945631, now seen corresponding path program 1 times [2024-11-08 18:38:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:38:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365163205] [2024-11-08 18:38:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:38:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:38:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:39:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 18:39:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:39:05,154 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:39:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:39:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365163205] [2024-11-08 18:39:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365163205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:39:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925210244] [2024-11-08 18:39:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:39:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:39:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:39:05,157 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:39:05,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 18:39:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:39:05,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 18:39:05,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:39:05,747 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:39:07,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 18:39:07,298 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:39:07,642 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:39:07,663 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:39:08,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:39:08,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 51 treesize of output 48 [2024-11-08 18:39:08,783 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:39:09,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:39:09,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 51 treesize of output 48 [2024-11-08 18:39:09,410 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:39:10,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:39:10,028 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:39:10,057 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:39:10,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:39:10,685 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:39:10,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-08 18:39:11,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 18:39:11,330 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:39:11,351 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:39:11,976 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:39:12,758 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 18:39:12,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-08 18:39:12,795 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:39:14,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:39:14,223 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 18:39:14,224 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:39:14,361 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-08 18:39:14,362 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:39:15,363 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-08 18:39:15,363 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:39:15,396 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:39:15,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:39:17,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int))) (or (not (= v_ArrVal_4807 (store .cse0 .cse1 (select v_ArrVal_4807 .cse1)))) (forall ((v_ArrVal_4808 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4807)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse7 .cse1 v_ArrVal_4808)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (<= (+ 384 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))))) (forall ((v_ArrVal_4807 (Array Int Int))) (or (not (= v_ArrVal_4807 (store .cse0 .cse1 (select v_ArrVal_4807 .cse1)))) (forall ((v_ArrVal_4808 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4807))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse7 .cse1 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2024-11-08 18:39:17,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse6)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse0) (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (forall ((v_ArrVal_4808 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4807)) (.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 .cse8 v_ArrVal_4808)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select .cse1 .cse2) .cse3) 384) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (= (store .cse9 .cse8 (select v_ArrVal_4807 .cse8)) v_ArrVal_4807))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store .cse9 .cse10 (select v_ArrVal_4807 .cse10)) v_ArrVal_4807)) (forall ((v_ArrVal_4808 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4807))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 .cse10 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse0))))))) is different from false [2024-11-08 18:39:18,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (select .cse7 .cse8)) (.cse0 (select .cse10 .cse8)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4807 .cse1)) v_ArrVal_4807)) (forall ((v_ArrVal_4808 Int)) (let ((.cse2 (store .cse10 .cse8 v_ArrVal_4807)) (.cse5 (store .cse7 .cse8 (store .cse9 .cse1 v_ArrVal_4808)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (<= (+ (select (select .cse2 .cse3) .cse4) 384) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse11))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (forall ((v_ArrVal_4808 Int)) (<= 0 (let ((.cse12 (store .cse10 .cse8 v_ArrVal_4807))) (select (select .cse12 (select (select (store .cse7 .cse8 (store .cse9 .cse13 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))) (not (= (store .cse0 .cse13 (select v_ArrVal_4807 .cse13)) v_ArrVal_4807))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse11))))))) is different from false [2024-11-08 18:39:18,313 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 791 [2024-11-08 18:39:19,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4807 .cse2)) v_ArrVal_4807)) (< (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4807))) (select (select .cse3 (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse6))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse8) .cse9 (select v_ArrVal_4807 .cse9)) v_ArrVal_4807)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse6) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse10 (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 v_ArrVal_4808)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse0 .cse8 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse13 (+ 40 v_prenex_64)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (< v_prenex_64 .cse6) (not (= v_prenex_63 (store (select .cse0 .cse12) .cse13 (select v_prenex_63 .cse13)))) (< 0 (+ (let ((.cse14 (store .cse0 .cse12 v_prenex_63))) (select (select .cse14 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1))))))))) is different from false [2024-11-08 18:39:23,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4800)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4799))) (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~malloc61#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 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4807 (store (select .cse0 .cse4) .cse5 (select v_ArrVal_4807 .cse5)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4800)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4799))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse13 (+ 40 v_prenex_64)) (.cse14 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0)))) (or (< 0 (+ (let ((.cse10 (store .cse14 .cse12 v_prenex_63))) (select (select .cse10 (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= v_prenex_63 (store (select .cse14 .cse12) .cse13 (select v_prenex_63 .cse13)))) (< v_prenex_64 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4800)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4799))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse21 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4807 (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4807 .cse21)))) (< (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4807))) (select (select .cse22 (select (select (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))) is different from false [2024-11-08 18:39:24,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4800)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4799))) (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~malloc61#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 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse6 .cse7 (store v_ArrVal_4800 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4807 .cse5)) v_ArrVal_4807)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4800)) (.cse19 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4799))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse19 .cse17 (store (select .cse19 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse13 (+ 40 v_prenex_64)) (.cse11 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0))) (.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_prenex_63 (store (select .cse11 .cse12) .cse13 (select v_prenex_63 .cse13)))) (< v_prenex_64 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse14 (store .cse11 .cse12 v_prenex_63))) (select (select .cse14 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse25 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4800)) (.cse28 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4799))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse28 .cse26 (store (select .cse28 .cse26) .cse27 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse20 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 0))) (.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse21 (store .cse20 .cse23 v_ArrVal_4807))) (select (select .cse21 (select (select (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4807 (store (select .cse20 .cse23) .cse24 (select v_ArrVal_4807 .cse24))))))))))))) is different from false [2024-11-08 18:39:34,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (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~malloc61#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 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse6 .cse7 (store v_ArrVal_4800 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4807 .cse5)) v_ArrVal_4807)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4798))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4797) .cse22 v_ArrVal_4800)) (.cse20 (store .cse21 .cse22 v_ArrVal_4799))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse14 (+ 40 v_prenex_64)) (.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse12 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0)))) (or (not (= (store (select .cse12 .cse13) .cse14 (select v_prenex_63 .cse14)) v_prenex_63)) (< 0 (+ (let ((.cse15 (store .cse12 .cse13 v_prenex_63))) (select (select .cse15 (select (select (store .cse16 .cse13 (store (select .cse16 .cse13) .cse14 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_64 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4798))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4797) .cse33 v_ArrVal_4800)) (.cse31 (store .cse32 .cse33 v_ArrVal_4799))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse31 .cse29 (store (select .cse31 .cse29) .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse23 (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 0))) (.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse24 (store .cse23 .cse26 v_ArrVal_4807))) (select (select .cse24 (select (select (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse23 .cse26) .cse27 (select v_ArrVal_4807 .cse27)) v_ArrVal_4807)))))))))))) is different from false [2024-11-08 18:39:40,372 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_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4798))) (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_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (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 ((.cse5 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse3 (+ 40 v_prenex_64)) (.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_64 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_63 (store (select .cse0 .cse2) .cse3 (select v_prenex_63 .cse3)))) (< 0 (+ (let ((.cse4 (store .cse0 .cse2 v_prenex_63))) (select (select .cse4 (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4798))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4797) .cse23 v_ArrVal_4800)) (.cse21 (store .cse22 .cse23 v_ArrVal_4799))) (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 ((.cse14 (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse16 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse17 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 0)))) (or (< (let ((.cse13 (store .cse17 .cse15 v_ArrVal_4807))) (select (select .cse13 (select (select (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse17 .cse15) .cse16 (select v_ArrVal_4807 .cse16)) v_ArrVal_4807)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse33 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4798))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4797) .cse34 v_ArrVal_4800)) (.cse32 (store .cse33 .cse34 v_ArrVal_4799))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse31 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse28 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 0))) (.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse24 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 v_ArrVal_4808)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse28 .cse26 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4807 (store (select (store .cse29 .cse30 (store v_ArrVal_4800 .cse31 0)) .cse26) .cse27 (select v_ArrVal_4807 .cse27))))))))))))))) is different from false [2024-11-08 18:39:46,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4795))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4796) .cse12 v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (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~malloc61#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 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4807 (store (select (store .cse6 .cse7 (store v_ArrVal_4800 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4807 .cse5)))))))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4795))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse26 .cse25 v_ArrVal_4798))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4796) .cse25 v_ArrVal_4797) .cse24 v_ArrVal_4800)) (.cse22 (store .cse23 .cse24 v_ArrVal_4799))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse22 .cse20 (store (select .cse22 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse14 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse15 (store .cse14 .cse17 v_ArrVal_4807))) (select (select .cse15 (select (select (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4807 (store (select .cse14 .cse17) .cse18 (select v_ArrVal_4807 .cse18)))))))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse39 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4795))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (store .cse39 .cse38 v_ArrVal_4798))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4796) .cse38 v_ArrVal_4797) .cse37 v_ArrVal_4800)) (.cse35 (store .cse36 .cse37 v_ArrVal_4799))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse34 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse35 .cse33 (store (select .cse35 .cse33) .cse34 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse29 (+ 40 v_prenex_64)) (.cse27 (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 0))) (.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_64 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_63 (store (select .cse27 .cse28) .cse29 (select v_prenex_63 .cse29)))) (< 0 (+ (let ((.cse30 (store .cse27 .cse28 v_prenex_63))) (select (select .cse30 (select (select (store .cse31 .cse28 (store (select .cse31 .cse28) .cse29 v_prenex_65)) |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:39:48,211 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_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4795))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4796) .cse13 v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse6 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 0))) (.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse2 .cse3 (store v_ArrVal_4800 .cse4 0)) .cse5) .cse6 (select v_ArrVal_4807 .cse6)) v_ArrVal_4807)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse7 (store .cse8 .cse5 (store (select .cse8 .cse5) .cse6 v_ArrVal_4808)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse5 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4795))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4798))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4796) .cse26 v_ArrVal_4797) .cse25 v_ArrVal_4800)) (.cse23 (store .cse24 .cse25 v_ArrVal_4799))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse19 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< (let ((.cse15 (store .cse19 .cse17 v_ArrVal_4807))) (select (select .cse15 (select (select (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse17) .cse18 (select v_ArrVal_4807 .cse18)) v_ArrVal_4807)))))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse40 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4795))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (store .cse40 .cse39 v_ArrVal_4798))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4796) .cse39 v_ArrVal_4797) .cse38 v_ArrVal_4800)) (.cse36 (store .cse37 .cse38 v_ArrVal_4799))) (let ((.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse36 .cse34 (store (select .cse36 .cse34) .cse35 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse30 (+ 40 v_prenex_64)) (.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 0)))) (or (not (= (store (select .cse28 .cse29) .cse30 (select v_prenex_63 .cse30)) v_prenex_63)) (< 0 (+ (let ((.cse31 (store .cse28 .cse29 v_prenex_63))) (select (select .cse31 (select (select (store .cse32 .cse29 (store (select .cse32 .cse29) .cse30 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_64 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-08 18:39:52,537 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:39:52,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:39:52,539 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 18:39:52,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 18:39:52,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:39:52,740 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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:842) 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.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) 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) ... 46 more [2024-11-08 18:39:52,743 INFO L158 Benchmark]: Toolchain (without parser) took 810257.12ms. Allocated memory was 180.4MB in the beginning and 469.8MB in the end (delta: 289.4MB). Free memory was 149.5MB in the beginning and 228.7MB in the end (delta: -79.2MB). Peak memory consumption was 210.0MB. Max. memory is 16.1GB. [2024-11-08 18:39:52,744 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory was 102.0MB in the beginning and 101.9MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:39:52,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1063.11ms. Allocated memory is still 180.4MB. Free memory was 149.3MB in the beginning and 113.8MB in the end (delta: 35.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-08 18:39:52,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.74ms. Allocated memory is still 180.4MB. Free memory was 113.8MB in the beginning and 106.3MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:39:52,744 INFO L158 Benchmark]: Boogie Preprocessor took 242.12ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 132.6MB in the end (delta: -26.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 18:39:52,744 INFO L158 Benchmark]: RCFGBuilder took 2993.09ms. Allocated memory was 180.4MB in the beginning and 224.4MB in the end (delta: 44.0MB). Free memory was 132.6MB in the beginning and 142.4MB in the end (delta: -9.8MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2024-11-08 18:39:52,744 INFO L158 Benchmark]: TraceAbstraction took 805838.98ms. Allocated memory was 224.4MB in the beginning and 469.8MB in the end (delta: 245.4MB). Free memory was 141.4MB in the beginning and 228.7MB in the end (delta: -87.3MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2024-11-08 18:39:52,745 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory was 102.0MB in the beginning and 101.9MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1063.11ms. Allocated memory is still 180.4MB. Free memory was 149.3MB in the beginning and 113.8MB in the end (delta: 35.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.74ms. Allocated memory is still 180.4MB. Free memory was 113.8MB in the beginning and 106.3MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 242.12ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 132.6MB in the end (delta: -26.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2993.09ms. Allocated memory was 180.4MB in the beginning and 224.4MB in the end (delta: 44.0MB). Free memory was 132.6MB in the beginning and 142.4MB in the end (delta: -9.8MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. * TraceAbstraction took 805838.98ms. Allocated memory was 224.4MB in the beginning and 469.8MB in the end (delta: 245.4MB). Free memory was 141.4MB in the beginning and 228.7MB in the end (delta: -87.3MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:39:54,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:39:55,010 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 18:39:55,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:39:55,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:39:55,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:39:55,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:39:55,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:39:55,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:39:55,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:39:55,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:39:55,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:39:55,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:39:55,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:39:55,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:39:55,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:39:55,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:39:55,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:39:55,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:39:55,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:39:55,057 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 18:39:55,057 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 18:39:55,058 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 18:39:55,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:39:55,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:39:55,060 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:39:55,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:39:55,060 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:39:55,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:39:55,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:39:55,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:39:55,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:39:55,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:39:55,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:39:55,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:39:55,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:39:55,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:39:55,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:39:55,065 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:39:55,065 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:39:55,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:39:55,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:39:55,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:39:55,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:39:55,075 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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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_9786103b-319b-47d1-bc2b-3e011b1fd11c/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-08 18:39:55,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:39:55,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:39:55,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:39:55,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:39:55,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:39:55,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i Unable to find full path for "g++" [2024-11-08 18:39:57,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:39:57,841 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:39:57,842 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-08 18:39:57,864 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data/ad313c527/4943643506414559a24d2c68a90e1338/FLAG50b9fa81d [2024-11-08 18:39:58,039 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/data/ad313c527/4943643506414559a24d2c68a90e1338 [2024-11-08 18:39:58,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:39:58,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:39:58,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:39:58,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:39:58,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:39:58,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:39:58" (1/1) ... [2024-11-08 18:39:58,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6181b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:58, skipping insertion in model container [2024-11-08 18:39:58,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:39:58" (1/1) ... [2024-11-08 18:39:58,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:39:58,767 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:39:58,822 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:39:58,833 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:39:58,840 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:39:58,857 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:39:58,923 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:39:58,924 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:39:58,930 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:39:58,934 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:39:58,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:39:58,965 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:39:59,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:39:59,151 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:39:59,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59 WrapperNode [2024-11-08 18:39:59,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:39:59,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:39:59,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:39:59,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:39:59,161 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:39:59" (1/1) ... [2024-11-08 18:39:59,210 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:39:59" (1/1) ... [2024-11-08 18:39:59,273 INFO L138 Inliner]: procedures = 210, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 862 [2024-11-08 18:39:59,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:39:59,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:39:59,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:39:59,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:39:59,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,393 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-08 18:39:59,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:39:59,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:39:59,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:39:59,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:39:59,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (1/1) ... [2024-11-08 18:39:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:39:59,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:39:59,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:39:59,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/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:39:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:39:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:39:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 18:39:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 18:39:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 18:39:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 18:39:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 18:39:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 18:39:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-08 18:39:59,544 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 18:39:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 18:39:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-08 18:39:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 18:39:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 18:39:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 18:39:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 18:39:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 18:39:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 18:39:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 18:39:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:39:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:39:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:39:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 18:39:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:39:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:39:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 18:39:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 18:39:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 18:39:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:39:59,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:39:59,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:39:59,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:39:59,842 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:39:59,907 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:39:59,936 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 18:40:03,811 INFO L? ?]: Removed 866 outVars from TransFormulas that were not future-live. [2024-11-08 18:40:03,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:40:03,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:40:03,859 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-08 18:40:03,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:40:03 BoogieIcfgContainer [2024-11-08 18:40:03,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:40:03,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:40:03,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:40:03,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:40:03,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:39:58" (1/3) ... [2024-11-08 18:40:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f37353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:40:03, skipping insertion in model container [2024-11-08 18:40:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:39:59" (2/3) ... [2024-11-08 18:40:03,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f37353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:40:03, skipping insertion in model container [2024-11-08 18:40:03,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:40:03" (3/3) ... [2024-11-08 18:40:03,875 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-11-08 18:40:03,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:40:03,895 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-08 18:40:03,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:40:03,980 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;@1857ddfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:40:03,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-08 18:40:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 863 states, 441 states have (on average 2.1859410430839) internal successors, (964), 858 states have internal predecessors, (964), 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:40:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 18:40:03,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:03,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 18:40:03,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:40:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1758111, now seen corresponding path program 1 times [2024-11-08 18:40:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:40:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517663702] [2024-11-08 18:40:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:04,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:40:04,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:40:04,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:40:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:04,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:40:04,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:40:04,300 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-08 18:40:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:40:04,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:40:04,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:40:04,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517663702] [2024-11-08 18:40:04,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517663702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:04,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:04,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:40:04,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665846955] [2024-11-08 18:40:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:40:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:40:04,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:40:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-08 18:40:04,339 INFO L87 Difference]: Start difference. First operand has 863 states, 441 states have (on average 2.1859410430839) internal successors, (964), 858 states have internal predecessors, (964), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:06,410 INFO L93 Difference]: Finished difference Result 1068 states and 1154 transitions. [2024-11-08 18:40:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:40:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 18:40:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:06,428 INFO L225 Difference]: With dead ends: 1068 [2024-11-08 18:40:06,429 INFO L226 Difference]: Without dead ends: 1065 [2024-11-08 18:40:06,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-08 18:40:06,433 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 237 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1155 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:06,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1265 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 1155 Unchecked, 2.0s Time] [2024-11-08 18:40:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-08 18:40:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 851. [2024-11-08 18:40:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 435 states have (on average 2.057471264367816) internal successors, (895), 846 states have internal predecessors, (895), 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:40:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 901 transitions. [2024-11-08 18:40:06,551 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 901 transitions. Word has length 4 [2024-11-08 18:40:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:06,552 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 901 transitions. [2024-11-08 18:40:06,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 901 transitions. [2024-11-08 18:40:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 18:40:06,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:06,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 18:40:06,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:40:06,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:06,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:40:06,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-08 18:40:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:40:06,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898327952] [2024-11-08 18:40:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:40:06,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:40:06,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:40:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:06,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:40:06,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:40:06,938 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:40:06,952 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:40:06,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:40:06,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:40:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898327952] [2024-11-08 18:40:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898327952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:06,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:06,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:40:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134134081] [2024-11-08 18:40:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:06,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:40:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:40:06,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:40:06,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:40:06,958 INFO L87 Difference]: Start difference. First operand 851 states and 901 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:08,272 INFO L93 Difference]: Finished difference Result 848 states and 899 transitions. [2024-11-08 18:40:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:40:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 18:40:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:08,276 INFO L225 Difference]: With dead ends: 848 [2024-11-08 18:40:08,277 INFO L226 Difference]: Without dead ends: 848 [2024-11-08 18:40:08,277 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:40:08,278 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 783 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:08,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 558 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:40:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-08 18:40:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2024-11-08 18:40:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 443 states have (on average 2.015801354401806) internal successors, (893), 843 states have internal predecessors, (893), 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:40:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 899 transitions. [2024-11-08 18:40:08,303 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 899 transitions. Word has length 4 [2024-11-08 18:40:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:08,303 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 899 transitions. [2024-11-08 18:40:08,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 899 transitions. [2024-11-08 18:40:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 18:40:08,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:08,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 18:40:08,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:40:08,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:08,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:40:08,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-08 18:40:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:40:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303703253] [2024-11-08 18:40:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:40:08,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:40:08,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:40:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:08,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:40:08,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:40:08,650 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:40:08,674 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:40:08,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:40:08,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:40:08,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303703253] [2024-11-08 18:40:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303703253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:08,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:40:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258668311] [2024-11-08 18:40:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:08,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:40:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:40:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:40:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:40:08,676 INFO L87 Difference]: Start difference. First operand 848 states and 899 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:10,808 INFO L93 Difference]: Finished difference Result 1061 states and 1135 transitions. [2024-11-08 18:40:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:40:10,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 18:40:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:10,812 INFO L225 Difference]: With dead ends: 1061 [2024-11-08 18:40:10,813 INFO L226 Difference]: Without dead ends: 1061 [2024-11-08 18:40:10,813 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:40:10,814 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 236 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:10,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1267 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 18:40:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-08 18:40:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 975. [2024-11-08 18:40:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 571 states have (on average 1.9719789842381787) internal successors, (1126), 970 states have internal predecessors, (1126), 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:40:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1132 transitions. [2024-11-08 18:40:10,842 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1132 transitions. Word has length 4 [2024-11-08 18:40:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:10,843 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1132 transitions. [2024-11-08 18:40:10,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1132 transitions. [2024-11-08 18:40:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:40:10,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:10,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:40:10,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:40:11,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:11,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-08 18:40:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-08 18:40:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:40:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586830046] [2024-11-08 18:40:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:11,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:40:11,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:40:11,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:40:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:11,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 18:40:11,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:40:11,212 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:40:11,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 18:40:11,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:40:11,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2024-11-08 18:40:11,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:40:11,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 18:40:11,391 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:40:11,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:40:11,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:40:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586830046] [2024-11-08 18:40:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586830046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:11,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:40:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293188254] [2024-11-08 18:40:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:40:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:40:11,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:40:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:40:11,394 INFO L87 Difference]: Start difference. First operand 975 states and 1132 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:17,409 INFO L93 Difference]: Finished difference Result 2028 states and 2260 transitions. [2024-11-08 18:40:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:40:17,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 18:40:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:17,415 INFO L225 Difference]: With dead ends: 2028 [2024-11-08 18:40:17,416 INFO L226 Difference]: Without dead ends: 2028 [2024-11-08 18:40:17,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:40:17,417 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 1412 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:17,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1058 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 18:40:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2024-11-08 18:40:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1162. [2024-11-08 18:40:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 758 states have (on average 1.9736147757255937) internal successors, (1496), 1155 states have internal predecessors, (1496), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 18:40:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1506 transitions. [2024-11-08 18:40:17,448 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1506 transitions. Word has length 8 [2024-11-08 18:40:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1506 transitions. [2024-11-08 18:40:17,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:40:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1506 transitions. [2024-11-08 18:40:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 18:40:17,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:17,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:40:17,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9786103b-319b-47d1-bc2b-3e011b1fd11c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0