./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/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 17:29:56,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:56,295 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:29:56,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:56,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:56,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:56,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:56,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:56,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:56,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:56,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:56,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:56,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:56,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:56,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:56,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:56,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:56,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:29:56,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:56,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:56,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:29:56,345 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:29:56,346 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:29:56,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:56,347 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:29:56,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:56,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:29:56,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:56,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:56,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:56,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:56,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:56,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:56,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:56,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:56,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:56,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:29:56,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:29:56,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:56,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:56,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:56,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:56,357 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_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/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 17:29:56,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:56,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:56,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:56,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:56,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:56,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i Unable to find full path for "g++" [2024-11-08 17:29:59,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:59,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:59,881 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-11-08 17:29:59,915 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data/9e8583289/b563bb34766b4be6b2027b6b778cfb71/FLAGc615ac8b6 [2024-11-08 17:29:59,945 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data/9e8583289/b563bb34766b4be6b2027b6b778cfb71 [2024-11-08 17:29:59,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:59,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:59,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:59,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:59,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:59,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:59" (1/1) ... [2024-11-08 17:29:59,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6359713a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:59, skipping insertion in model container [2024-11-08 17:29:59,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:59" (1/1) ... [2024-11-08 17:30:00,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:30:00,806 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 17:30:00,851 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 17:30:00,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 17:30:00,864 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 17:30:00,879 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 17:30:00,929 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 17:30:00,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 17:30:00,935 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 17:30:00,935 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 17:30:00,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:30:00,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:30:01,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:30:01,252 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:30:01,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01 WrapperNode [2024-11-08 17:30:01,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:30:01,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:30:01,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:30:01,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:30:01,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,461 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-08 17:30:01,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:30:01,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:30:01,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:30:01,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:30:01,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,582 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 17:30:01,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:30:01,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:30:01,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:30:01,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:30:01,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (1/1) ... [2024-11-08 17:30:01,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:30:01,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:01,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:30:01,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:30:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 17:30:01,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 17:30:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-08 17:30:01,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 17:30:01,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 17:30:01,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-08 17:30:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 17:30:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:30:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:30:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 17:30:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:30:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:30:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:30:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:30:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:30:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:30:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:30:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:30:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:30:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:30:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:30:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 17:30:01,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:30:01,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:30:01,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:30:01,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:30:01,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:30:02,198 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:30:02,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:30:02,204 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:30:02,263 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:30:02,292 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:30:05,374 INFO L? ?]: Removed 1030 outVars from TransFormulas that were not future-live. [2024-11-08 17:30:05,375 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:30:05,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:30:05,445 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-08 17:30:05,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:30:05 BoogieIcfgContainer [2024-11-08 17:30:05,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:30:05,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:30:05,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:30:05,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:30:05,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:59" (1/3) ... [2024-11-08 17:30:05,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11871d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:30:05, skipping insertion in model container [2024-11-08 17:30:05,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:30:01" (2/3) ... [2024-11-08 17:30:05,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11871d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:30:05, skipping insertion in model container [2024-11-08 17:30:05,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:30:05" (3/3) ... [2024-11-08 17:30:05,466 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2024-11-08 17:30:05,492 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:30:05,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-08 17:30:05,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:30:05,599 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;@6360c588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:30:05,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-08 17:30:05,610 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 17:30:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:30:05,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:05,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:30:05,619 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 17:30:05,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1758814, now seen corresponding path program 1 times [2024-11-08 17:30:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428035719] [2024-11-08 17:30:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:06,026 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 17:30:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428035719] [2024-11-08 17:30:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428035719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:06,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:06,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040576568] [2024-11-08 17:30:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:06,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:06,094 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 17:30:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:07,850 INFO L93 Difference]: Finished difference Result 1355 states and 1614 transitions. [2024-11-08 17:30:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:07,854 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 17:30:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:07,881 INFO L225 Difference]: With dead ends: 1355 [2024-11-08 17:30:07,881 INFO L226 Difference]: Without dead ends: 1351 [2024-11-08 17:30:07,884 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 17:30:07,889 INFO L432 NwaCegarLoop]: 1106 mSDtfsCounter, 386 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:07,891 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.6s Time] [2024-11-08 17:30:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-08 17:30:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1266. [2024-11-08 17:30:08,023 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 17:30:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1606 transitions. [2024-11-08 17:30:08,032 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1606 transitions. Word has length 4 [2024-11-08 17:30:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:08,033 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1606 transitions. [2024-11-08 17:30:08,033 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 17:30:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1606 transitions. [2024-11-08 17:30:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:30:08,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:08,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:30:08,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:30:08,035 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 17:30:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-08 17:30:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980559865] [2024-11-08 17:30:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:08,192 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 17:30:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:08,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980559865] [2024-11-08 17:30:08,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980559865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:08,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:08,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:30:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327282844] [2024-11-08 17:30:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:08,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:08,199 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 17:30:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:09,106 INFO L93 Difference]: Finished difference Result 1263 states and 1598 transitions. [2024-11-08 17:30:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:09,109 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 17:30:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:09,117 INFO L225 Difference]: With dead ends: 1263 [2024-11-08 17:30:09,117 INFO L226 Difference]: Without dead ends: 1263 [2024-11-08 17:30:09,122 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 17:30:09,124 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 1094 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:09,128 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.8s Time] [2024-11-08 17:30:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-08 17:30:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2024-11-08 17:30:09,180 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 17:30:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1598 transitions. [2024-11-08 17:30:09,187 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1598 transitions. Word has length 4 [2024-11-08 17:30:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:09,187 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1598 transitions. [2024-11-08 17:30:09,188 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 17:30:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1598 transitions. [2024-11-08 17:30:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:30:09,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:09,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:30:09,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:30:09,191 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 17:30:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-08 17:30:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377591065] [2024-11-08 17:30:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:09,295 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 17:30:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377591065] [2024-11-08 17:30:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377591065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:09,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:30:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097034992] [2024-11-08 17:30:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:09,299 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 17:30:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:10,401 INFO L93 Difference]: Finished difference Result 1347 states and 1593 transitions. [2024-11-08 17:30:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:10,402 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 17:30:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:10,412 INFO L225 Difference]: With dead ends: 1347 [2024-11-08 17:30:10,412 INFO L226 Difference]: Without dead ends: 1347 [2024-11-08 17:30:10,413 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 17:30:10,416 INFO L432 NwaCegarLoop]: 1108 mSDtfsCounter, 384 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:10,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1890 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:30:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-08 17:30:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1262. [2024-11-08 17:30:10,453 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 17:30:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1591 transitions. [2024-11-08 17:30:10,462 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1591 transitions. Word has length 4 [2024-11-08 17:30:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1591 transitions. [2024-11-08 17:30:10,463 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 17:30:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1591 transitions. [2024-11-08 17:30:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:30:10,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:10,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:10,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:30:10,466 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 17:30:10,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-08 17:30:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110468464] [2024-11-08 17:30:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:10,812 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 17:30:10,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:10,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110468464] [2024-11-08 17:30:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110468464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:10,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:10,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:10,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278573990] [2024-11-08 17:30:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:10,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:10,817 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 17:30:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:12,646 INFO L93 Difference]: Finished difference Result 1336 states and 1581 transitions. [2024-11-08 17:30:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:30:12,648 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 17:30:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:12,657 INFO L225 Difference]: With dead ends: 1336 [2024-11-08 17:30:12,657 INFO L226 Difference]: Without dead ends: 1336 [2024-11-08 17:30:12,658 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 17:30:12,660 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 3345 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:12,665 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.7s Time] [2024-11-08 17:30:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-08 17:30:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1251. [2024-11-08 17:30:12,706 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 17:30:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1579 transitions. [2024-11-08 17:30:12,714 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1579 transitions. Word has length 8 [2024-11-08 17:30:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:12,714 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1579 transitions. [2024-11-08 17:30:12,715 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 17:30:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1579 transitions. [2024-11-08 17:30:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:30:12,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:12,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:12,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:30:12,718 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 17:30:12,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-08 17:30:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:12,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665433067] [2024-11-08 17:30:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:12,850 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 17:30:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665433067] [2024-11-08 17:30:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665433067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:30:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684762033] [2024-11-08 17:30:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:12,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:12,854 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 17:30:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:13,889 INFO L93 Difference]: Finished difference Result 1289 states and 1534 transitions. [2024-11-08 17:30:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:13,890 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 17:30:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:13,895 INFO L225 Difference]: With dead ends: 1289 [2024-11-08 17:30:13,896 INFO L226 Difference]: Without dead ends: 1289 [2024-11-08 17:30:13,896 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 17:30:13,897 INFO L432 NwaCegarLoop]: 1123 mSDtfsCounter, 1068 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:13,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1423 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:30:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-08 17:30:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1204. [2024-11-08 17:30:13,926 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 17:30:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1532 transitions. [2024-11-08 17:30:13,933 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1532 transitions. Word has length 9 [2024-11-08 17:30:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:13,933 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1532 transitions. [2024-11-08 17:30:13,934 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 17:30:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1532 transitions. [2024-11-08 17:30:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:30:13,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:13,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:13,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:30:13,935 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 17:30:13,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-08 17:30:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505684070] [2024-11-08 17:30:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:14,055 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 17:30:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505684070] [2024-11-08 17:30:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505684070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:30:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757190064] [2024-11-08 17:30:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:14,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:14,059 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 17:30:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:15,087 INFO L93 Difference]: Finished difference Result 1491 states and 1897 transitions. [2024-11-08 17:30:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:15,088 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 17:30:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:15,094 INFO L225 Difference]: With dead ends: 1491 [2024-11-08 17:30:15,095 INFO L226 Difference]: Without dead ends: 1491 [2024-11-08 17:30:15,095 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 17:30:15,096 INFO L432 NwaCegarLoop]: 1256 mSDtfsCounter, 858 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:15,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1676 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:30:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2024-11-08 17:30:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1179. [2024-11-08 17:30:15,126 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 17:30:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1507 transitions. [2024-11-08 17:30:15,132 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1507 transitions. Word has length 9 [2024-11-08 17:30:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:15,132 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1507 transitions. [2024-11-08 17:30:15,133 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 17:30:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1507 transitions. [2024-11-08 17:30:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 17:30:15,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:15,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:15,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:30:15,134 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 17:30:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1409972164, now seen corresponding path program 1 times [2024-11-08 17:30:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089606413] [2024-11-08 17:30:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,207 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 17:30:15,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:15,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089606413] [2024-11-08 17:30:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089606413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:15,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:15,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:15,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429381587] [2024-11-08 17:30:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:15,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:15,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:15,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:15,211 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 17:30:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:16,169 INFO L93 Difference]: Finished difference Result 1254 states and 1613 transitions. [2024-11-08 17:30:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:16,173 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 17:30:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:16,179 INFO L225 Difference]: With dead ends: 1254 [2024-11-08 17:30:16,179 INFO L226 Difference]: Without dead ends: 1254 [2024-11-08 17:30:16,180 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 17:30:16,183 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 1295 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:16,184 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.9s Time] [2024-11-08 17:30:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-08 17:30:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1156. [2024-11-08 17:30:16,212 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 17:30:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1461 transitions. [2024-11-08 17:30:16,218 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1461 transitions. Word has length 15 [2024-11-08 17:30:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:16,219 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1461 transitions. [2024-11-08 17:30:16,219 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 17:30:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1461 transitions. [2024-11-08 17:30:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 17:30:16,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:16,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:30:16,221 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 17:30:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1409972163, now seen corresponding path program 1 times [2024-11-08 17:30:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467173305] [2024-11-08 17:30:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:16,329 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 17:30:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467173305] [2024-11-08 17:30:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467173305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:16,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12908758] [2024-11-08 17:30:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:16,335 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 17:30:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:16,379 INFO L93 Difference]: Finished difference Result 1016 states and 1251 transitions. [2024-11-08 17:30:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:16,380 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 17:30:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:16,384 INFO L225 Difference]: With dead ends: 1016 [2024-11-08 17:30:16,385 INFO L226 Difference]: Without dead ends: 1016 [2024-11-08 17:30:16,385 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 17:30:16,386 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 17:30:16,386 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 17:30:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-08 17:30:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-08 17:30:16,412 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 17:30:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1251 transitions. [2024-11-08 17:30:16,418 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1251 transitions. Word has length 15 [2024-11-08 17:30:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:16,419 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1251 transitions. [2024-11-08 17:30:16,419 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 17:30:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1251 transitions. [2024-11-08 17:30:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 17:30:16,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:16,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:30:16,423 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 17:30:16,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash -752693253, now seen corresponding path program 1 times [2024-11-08 17:30:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084570370] [2024-11-08 17:30:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:16,528 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 17:30:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084570370] [2024-11-08 17:30:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084570370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847104566] [2024-11-08 17:30:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:16,533 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 17:30:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:16,651 INFO L93 Difference]: Finished difference Result 987 states and 1201 transitions. [2024-11-08 17:30:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:16,652 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 17:30:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:16,656 INFO L225 Difference]: With dead ends: 987 [2024-11-08 17:30:16,657 INFO L226 Difference]: Without dead ends: 987 [2024-11-08 17:30:16,657 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 17:30:16,661 INFO L432 NwaCegarLoop]: 942 mSDtfsCounter, 41 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:16,662 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.1s Time] [2024-11-08 17:30:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-08 17:30:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 981. [2024-11-08 17:30:16,684 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 17:30:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1195 transitions. [2024-11-08 17:30:16,691 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1195 transitions. Word has length 16 [2024-11-08 17:30:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:16,692 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1195 transitions. [2024-11-08 17:30:16,692 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 17:30:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1195 transitions. [2024-11-08 17:30:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 17:30:16,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:16,694 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 17:30:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:30:16,694 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 17:30:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1271928384, now seen corresponding path program 1 times [2024-11-08 17:30:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905099843] [2024-11-08 17:30:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:30:16,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:16,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905099843] [2024-11-08 17:30:16,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905099843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:16,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:16,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:16,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386786577] [2024-11-08 17:30:16,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:16,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:16,802 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 17:30:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:17,879 INFO L93 Difference]: Finished difference Result 1050 states and 1250 transitions. [2024-11-08 17:30:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:17,879 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 17:30:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:17,884 INFO L225 Difference]: With dead ends: 1050 [2024-11-08 17:30:17,884 INFO L226 Difference]: Without dead ends: 1050 [2024-11-08 17:30:17,885 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 17:30:17,885 INFO L432 NwaCegarLoop]: 829 mSDtfsCounter, 1178 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:17,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1659 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:30:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-08 17:30:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 958. [2024-11-08 17:30:17,909 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 17:30:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1172 transitions. [2024-11-08 17:30:17,913 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1172 transitions. Word has length 20 [2024-11-08 17:30:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:17,914 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1172 transitions. [2024-11-08 17:30:17,914 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 17:30:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1172 transitions. [2024-11-08 17:30:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 17:30:17,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:17,916 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 17:30:17,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:30:17,916 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 17:30:17,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1271928383, now seen corresponding path program 1 times [2024-11-08 17:30:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:17,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460941817] [2024-11-08 17:30:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:17,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:30:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460941817] [2024-11-08 17:30:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460941817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725152813] [2024-11-08 17:30:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:18,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:18,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:18,015 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 17:30:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:18,060 INFO L93 Difference]: Finished difference Result 882 states and 1067 transitions. [2024-11-08 17:30:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:18,061 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 17:30:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:18,064 INFO L225 Difference]: With dead ends: 882 [2024-11-08 17:30:18,065 INFO L226 Difference]: Without dead ends: 882 [2024-11-08 17:30:18,065 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 17:30:18,066 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 17:30:18,066 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 17:30:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-08 17:30:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-11-08 17:30:18,086 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 17:30:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1067 transitions. [2024-11-08 17:30:18,090 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1067 transitions. Word has length 20 [2024-11-08 17:30:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:18,091 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1067 transitions. [2024-11-08 17:30:18,091 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 17:30:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1067 transitions. [2024-11-08 17:30:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 17:30:18,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:18,092 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 17:30:18,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:30:18,093 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 17:30:18,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash -768304611, now seen corresponding path program 1 times [2024-11-08 17:30:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852663630] [2024-11-08 17:30:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:18,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,178 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 17:30:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852663630] [2024-11-08 17:30:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852663630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107986965] [2024-11-08 17:30:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:18,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:18,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:18,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:18,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:18,181 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 17:30:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:18,273 INFO L93 Difference]: Finished difference Result 864 states and 1042 transitions. [2024-11-08 17:30:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:18,273 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 17:30:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:18,277 INFO L225 Difference]: With dead ends: 864 [2024-11-08 17:30:18,278 INFO L226 Difference]: Without dead ends: 864 [2024-11-08 17:30:18,278 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 17:30:18,280 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 41 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:18,281 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.1s Time] [2024-11-08 17:30:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-08 17:30:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 861. [2024-11-08 17:30:18,301 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 17:30:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1039 transitions. [2024-11-08 17:30:18,335 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1039 transitions. Word has length 21 [2024-11-08 17:30:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:18,336 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1039 transitions. [2024-11-08 17:30:18,336 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 17:30:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1039 transitions. [2024-11-08 17:30:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 17:30:18,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:18,338 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 17:30:18,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:30:18,338 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 17:30:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash -607542615, now seen corresponding path program 1 times [2024-11-08 17:30:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307621528] [2024-11-08 17:30:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,527 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 17:30:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307621528] [2024-11-08 17:30:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307621528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:18,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480348403] [2024-11-08 17:30:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:18,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:18,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:18,531 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 17:30:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:19,534 INFO L93 Difference]: Finished difference Result 949 states and 1113 transitions. [2024-11-08 17:30:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:19,535 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 17:30:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:19,539 INFO L225 Difference]: With dead ends: 949 [2024-11-08 17:30:19,539 INFO L226 Difference]: Without dead ends: 949 [2024-11-08 17:30:19,540 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 17:30:19,541 INFO L432 NwaCegarLoop]: 755 mSDtfsCounter, 383 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:19,542 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.9s Time] [2024-11-08 17:30:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-08 17:30:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 861. [2024-11-08 17:30:19,564 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 17:30:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1035 transitions. [2024-11-08 17:30:19,569 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1035 transitions. Word has length 30 [2024-11-08 17:30:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1035 transitions. [2024-11-08 17:30:19,570 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 17:30:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1035 transitions. [2024-11-08 17:30:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 17:30:19,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:19,574 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 17:30:19,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:30:19,575 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 17:30:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1697897099, now seen corresponding path program 1 times [2024-11-08 17:30:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:19,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764145051] [2024-11-08 17:30:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:19,789 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 17:30:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764145051] [2024-11-08 17:30:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764145051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134950381] [2024-11-08 17:30:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:19,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:19,792 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 17:30:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:20,990 INFO L93 Difference]: Finished difference Result 1184 states and 1432 transitions. [2024-11-08 17:30:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:20,991 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 17:30:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:20,997 INFO L225 Difference]: With dead ends: 1184 [2024-11-08 17:30:20,997 INFO L226 Difference]: Without dead ends: 1184 [2024-11-08 17:30:20,998 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 17:30:20,998 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 649 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:20,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1909 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:30:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-11-08 17:30:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 857. [2024-11-08 17:30:21,026 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 17:30:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1031 transitions. [2024-11-08 17:30:21,032 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1031 transitions. Word has length 35 [2024-11-08 17:30:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:21,032 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1031 transitions. [2024-11-08 17:30:21,033 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 17:30:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1031 transitions. [2024-11-08 17:30:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 17:30:21,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:21,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] [2024-11-08 17:30:21,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:30:21,036 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 17:30:21,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:21,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1487707269, now seen corresponding path program 1 times [2024-11-08 17:30:21,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:21,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764921064] [2024-11-08 17:30:21,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:21,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:21,174 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 17:30:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764921064] [2024-11-08 17:30:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764921064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943055422] [2024-11-08 17:30:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:21,178 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 17:30:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:21,258 INFO L93 Difference]: Finished difference Result 857 states and 1023 transitions. [2024-11-08 17:30:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:30:21,259 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 17:30:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:21,263 INFO L225 Difference]: With dead ends: 857 [2024-11-08 17:30:21,264 INFO L226 Difference]: Without dead ends: 857 [2024-11-08 17:30:21,264 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 17:30:21,265 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:21,265 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.1s Time] [2024-11-08 17:30:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-08 17:30:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2024-11-08 17:30:21,283 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 17:30:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1023 transitions. [2024-11-08 17:30:21,287 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1023 transitions. Word has length 62 [2024-11-08 17:30:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:21,287 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1023 transitions. [2024-11-08 17:30:21,287 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 17:30:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1023 transitions. [2024-11-08 17:30:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 17:30:21,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:21,289 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 17:30:21,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:30:21,290 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 17:30:21,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -267693667, now seen corresponding path program 1 times [2024-11-08 17:30:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:21,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485345367] [2024-11-08 17:30:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:21,454 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 17:30:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485345367] [2024-11-08 17:30:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485345367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789391318] [2024-11-08 17:30:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:21,458 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 17:30:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:21,534 INFO L93 Difference]: Finished difference Result 857 states and 1019 transitions. [2024-11-08 17:30:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:30:21,535 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 17:30:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:21,539 INFO L225 Difference]: With dead ends: 857 [2024-11-08 17:30:21,539 INFO L226 Difference]: Without dead ends: 857 [2024-11-08 17:30:21,540 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 17:30:21,540 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:21,541 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.1s Time] [2024-11-08 17:30:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-08 17:30:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2024-11-08 17:30:21,559 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 17:30:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1019 transitions. [2024-11-08 17:30:21,562 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1019 transitions. Word has length 69 [2024-11-08 17:30:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:21,563 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1019 transitions. [2024-11-08 17:30:21,563 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 17:30:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1019 transitions. [2024-11-08 17:30:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 17:30:21,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:21,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:21,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:30:21,565 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 17:30:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1846394823, now seen corresponding path program 1 times [2024-11-08 17:30:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:21,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749673016] [2024-11-08 17:30:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:21,701 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 17:30:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749673016] [2024-11-08 17:30:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749673016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:21,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:30:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971818420] [2024-11-08 17:30:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:30:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:30:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:30:21,708 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 17:30:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:21,809 INFO L93 Difference]: Finished difference Result 1020 states and 1190 transitions. [2024-11-08 17:30:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:30:21,810 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 17:30:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:21,814 INFO L225 Difference]: With dead ends: 1020 [2024-11-08 17:30:21,815 INFO L226 Difference]: Without dead ends: 1020 [2024-11-08 17:30:21,815 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 17:30:21,816 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 198 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 17:30:21,816 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 17:30:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-08 17:30:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1010. [2024-11-08 17:30:21,839 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 17:30:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1186 transitions. [2024-11-08 17:30:21,845 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1186 transitions. Word has length 70 [2024-11-08 17:30:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:21,846 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1186 transitions. [2024-11-08 17:30:21,846 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 17:30:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1186 transitions. [2024-11-08 17:30:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 17:30:21,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:21,848 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 17:30:21,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:30:21,848 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 17:30:21,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash 438438093, now seen corresponding path program 1 times [2024-11-08 17:30:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:21,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079943241] [2024-11-08 17:30:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:22,556 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 17:30:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079943241] [2024-11-08 17:30:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079943241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:22,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:30:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238456892] [2024-11-08 17:30:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:22,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:30:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:30:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:30:22,560 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 17:30:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:22,988 INFO L93 Difference]: Finished difference Result 1484 states and 1692 transitions. [2024-11-08 17:30:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:30:22,989 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 17:30:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:22,996 INFO L225 Difference]: With dead ends: 1484 [2024-11-08 17:30:22,996 INFO L226 Difference]: Without dead ends: 1481 [2024-11-08 17:30:22,997 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 17:30:22,997 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 733 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:22,998 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.3s Time] [2024-11-08 17:30:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2024-11-08 17:30:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 911. [2024-11-08 17:30:23,025 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 17:30:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1058 transitions. [2024-11-08 17:30:23,029 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1058 transitions. Word has length 76 [2024-11-08 17:30:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:23,030 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1058 transitions. [2024-11-08 17:30:23,031 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 17:30:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1058 transitions. [2024-11-08 17:30:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 17:30:23,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:23,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] [2024-11-08 17:30:23,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:30:23,033 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 17:30:23,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1698343876, now seen corresponding path program 1 times [2024-11-08 17:30:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954453215] [2024-11-08 17:30:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:23,498 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 17:30:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954453215] [2024-11-08 17:30:23,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954453215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196533528] [2024-11-08 17:30:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:23,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:23,502 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 17:30:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:24,554 INFO L93 Difference]: Finished difference Result 910 states and 1057 transitions. [2024-11-08 17:30:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:30:24,555 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 17:30:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:24,560 INFO L225 Difference]: With dead ends: 910 [2024-11-08 17:30:24,561 INFO L226 Difference]: Without dead ends: 910 [2024-11-08 17:30:24,561 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 17:30:24,562 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 2 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:24,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2299 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:30:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-08 17:30:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2024-11-08 17:30:24,582 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 17:30:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1057 transitions. [2024-11-08 17:30:24,586 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1057 transitions. Word has length 85 [2024-11-08 17:30:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:24,586 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1057 transitions. [2024-11-08 17:30:24,587 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 17:30:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1057 transitions. [2024-11-08 17:30:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 17:30:24,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:24,588 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 17:30:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:30:24,589 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 17:30:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1698343875, now seen corresponding path program 1 times [2024-11-08 17:30:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656352597] [2024-11-08 17:30:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,348 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 17:30:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656352597] [2024-11-08 17:30:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656352597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510804806] [2024-11-08 17:30:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:25,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:25,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:25,351 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 17:30:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:26,488 INFO L93 Difference]: Finished difference Result 909 states and 1056 transitions. [2024-11-08 17:30:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:30:26,488 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 17:30:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:26,493 INFO L225 Difference]: With dead ends: 909 [2024-11-08 17:30:26,493 INFO L226 Difference]: Without dead ends: 909 [2024-11-08 17:30:26,493 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 17:30:26,494 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 1 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:26,494 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.1s Time] [2024-11-08 17:30:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-08 17:30:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2024-11-08 17:30:26,514 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 17:30:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1056 transitions. [2024-11-08 17:30:26,517 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1056 transitions. Word has length 85 [2024-11-08 17:30:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1056 transitions. [2024-11-08 17:30:26,518 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 17:30:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1056 transitions. [2024-11-08 17:30:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:30:26,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:26,520 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 17:30:26,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:30:26,520 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 17:30:26,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash -355007197, now seen corresponding path program 1 times [2024-11-08 17:30:26,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:26,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113737326] [2024-11-08 17:30:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:26,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:26,969 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 17:30:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:26,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113737326] [2024-11-08 17:30:26,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113737326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:26,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:26,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:30:26,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576580096] [2024-11-08 17:30:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:26,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:30:26,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:30:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:30:26,974 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 17:30:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:28,354 INFO L93 Difference]: Finished difference Result 921 states and 1071 transitions. [2024-11-08 17:30:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:30:28,355 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 17:30:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:28,362 INFO L225 Difference]: With dead ends: 921 [2024-11-08 17:30:28,362 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 17:30:28,362 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 17:30:28,363 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 10 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:28,363 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.3s Time] [2024-11-08 17:30:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 17:30:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2024-11-08 17:30:28,384 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 17:30:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1066 transitions. [2024-11-08 17:30:28,387 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1066 transitions. Word has length 93 [2024-11-08 17:30:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:28,388 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1066 transitions. [2024-11-08 17:30:28,388 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 17:30:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1066 transitions. [2024-11-08 17:30:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:30:28,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:28,390 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 17:30:28,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:30:28,390 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 17:30:28,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -355007196, now seen corresponding path program 1 times [2024-11-08 17:30:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874738920] [2024-11-08 17:30:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,480 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 17:30:29,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874738920] [2024-11-08 17:30:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874738920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:30:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976595911] [2024-11-08 17:30:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:30:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:30:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:30:29,486 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 17:30:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:30,741 INFO L93 Difference]: Finished difference Result 915 states and 1065 transitions. [2024-11-08 17:30:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:30:30,742 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 17:30:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:30,746 INFO L225 Difference]: With dead ends: 915 [2024-11-08 17:30:30,746 INFO L226 Difference]: Without dead ends: 915 [2024-11-08 17:30:30,747 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 17:30:30,748 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 5 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:30,748 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.2s Time] [2024-11-08 17:30:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-11-08 17:30:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2024-11-08 17:30:30,765 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 17:30:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1065 transitions. [2024-11-08 17:30:30,768 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1065 transitions. Word has length 93 [2024-11-08 17:30:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:30,769 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1065 transitions. [2024-11-08 17:30:30,769 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 17:30:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1065 transitions. [2024-11-08 17:30:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:30:30,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:30,770 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 17:30:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:30:30,771 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 17:30:30,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1794296714, now seen corresponding path program 1 times [2024-11-08 17:30:30,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025845784] [2024-11-08 17:30:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:30,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:31,547 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 17:30:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025845784] [2024-11-08 17:30:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025845784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:31,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179955306] [2024-11-08 17:30:31,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:31,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:31,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:31,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:30:31,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:30:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:31,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:30:31,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:31,899 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 17:30:32,129 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:30:32,130 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 17:30:32,210 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 17:30:32,332 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 17:30:32,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:30:32,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:30:32,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 17:30:32,682 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 17:30:32,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179955306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:32,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:30:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-08 17:30:32,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187064517] [2024-11-08 17:30:32,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:30:32,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:30:32,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:32,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:30:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=321, Unknown=5, NotChecked=0, Total=380 [2024-11-08 17:30:32,796 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 17:30:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:36,001 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2024-11-08 17:30:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:30:36,002 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 17:30:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:36,005 INFO L225 Difference]: With dead ends: 922 [2024-11-08 17:30:36,006 INFO L226 Difference]: Without dead ends: 922 [2024-11-08 17:30:36,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=508, Unknown=5, NotChecked=0, Total=600 [2024-11-08 17:30:36,010 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 702 mSDsluCounter, 5259 mSDsCounter, 0 mSdLazyCounter, 3638 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:36,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 5752 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3638 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 17:30:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-08 17:30:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-08 17:30:36,030 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 17:30:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1067 transitions. [2024-11-08 17:30:36,034 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1067 transitions. Word has length 94 [2024-11-08 17:30:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:36,034 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1067 transitions. [2024-11-08 17:30:36,035 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 17:30:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1067 transitions. [2024-11-08 17:30:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:30:36,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:36,037 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 17:30:36,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:30:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-08 17:30:36,239 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 17:30:36,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1794296713, now seen corresponding path program 1 times [2024-11-08 17:30:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:36,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765122187] [2024-11-08 17:30:36,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:37,452 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 17:30:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765122187] [2024-11-08 17:30:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765122187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467973088] [2024-11-08 17:30:37,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:37,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:30:37,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:30:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:37,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:30:37,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:37,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:30:37,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:30:37,939 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 17:30:37,949 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 17:30:37,984 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 17:30:37,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:30:38,112 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 17:30:38,117 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 17:30:38,271 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:30:38,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:30:38,278 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 17:30:38,337 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 17:30:38,345 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 17:30:38,372 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 17:30:38,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:38,511 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 17:30:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467973088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:38,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:30:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-08 17:30:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411074981] [2024-11-08 17:30:38,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:30:38,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:30:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:38,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:30:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-08 17:30:38,523 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 17:30:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:41,604 INFO L93 Difference]: Finished difference Result 921 states and 1071 transitions. [2024-11-08 17:30:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:30:41,604 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 17:30:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:41,608 INFO L225 Difference]: With dead ends: 921 [2024-11-08 17:30:41,608 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 17:30:41,609 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 17:30:41,609 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 17:30:41,610 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 17:30:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 17:30:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 912. [2024-11-08 17:30:41,626 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 17:30:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1059 transitions. [2024-11-08 17:30:41,629 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1059 transitions. Word has length 94 [2024-11-08 17:30:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:41,629 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1059 transitions. [2024-11-08 17:30:41,630 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 17:30:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1059 transitions. [2024-11-08 17:30:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:30:41,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:41,631 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 17:30:41,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:30:41,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:41,832 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 17:30:41,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1809290499, now seen corresponding path program 1 times [2024-11-08 17:30:41,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:41,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955357615] [2024-11-08 17:30:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:42,612 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 17:30:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955357615] [2024-11-08 17:30:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955357615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:30:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71169237] [2024-11-08 17:30:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:42,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:30:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:42,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:30:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:30:42,616 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 17:30:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:44,667 INFO L93 Difference]: Finished difference Result 925 states and 1075 transitions. [2024-11-08 17:30:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:30:44,669 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 17:30:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:44,672 INFO L225 Difference]: With dead ends: 925 [2024-11-08 17:30:44,672 INFO L226 Difference]: Without dead ends: 925 [2024-11-08 17:30:44,673 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 17:30:44,673 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 732 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:44,674 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.9s Time] [2024-11-08 17:30:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-08 17:30:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2024-11-08 17:30:44,689 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 17:30:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1070 transitions. [2024-11-08 17:30:44,692 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1070 transitions. Word has length 96 [2024-11-08 17:30:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:44,693 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1070 transitions. [2024-11-08 17:30:44,693 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 17:30:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1070 transitions. [2024-11-08 17:30:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:30:44,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:44,694 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 17:30:44,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:30:44,695 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 17:30:44,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1809290498, now seen corresponding path program 1 times [2024-11-08 17:30:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175173124] [2024-11-08 17:30:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:45,714 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 17:30:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175173124] [2024-11-08 17:30:45,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175173124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:45,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:45,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:30:45,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211145890] [2024-11-08 17:30:45,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:45,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:30:45,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:45,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:30:45,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:30:45,717 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 17:30:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:47,860 INFO L93 Difference]: Finished difference Result 924 states and 1074 transitions. [2024-11-08 17:30:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:30:47,860 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 17:30:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:47,862 INFO L225 Difference]: With dead ends: 924 [2024-11-08 17:30:47,863 INFO L226 Difference]: Without dead ends: 924 [2024-11-08 17:30:47,863 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 17:30:47,864 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 728 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:47,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3359 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:30:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-08 17:30:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-08 17:30:47,880 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 17:30:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1069 transitions. [2024-11-08 17:30:47,883 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1069 transitions. Word has length 96 [2024-11-08 17:30:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:47,883 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1069 transitions. [2024-11-08 17:30:47,883 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 17:30:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1069 transitions. [2024-11-08 17:30:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 17:30:47,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:47,885 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 17:30:47,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:30:47,885 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 17:30:47,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1270191818, now seen corresponding path program 1 times [2024-11-08 17:30:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:47,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158786846] [2024-11-08 17:30:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:48,750 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 17:30:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158786846] [2024-11-08 17:30:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158786846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:48,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569557258] [2024-11-08 17:30:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:48,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:48,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:48,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:30:48,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:30:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:49,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:30:49,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:49,087 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 17:30:49,262 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:30:49,262 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 17:30:49,310 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 17:30:49,424 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 17:30:49,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:30:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:30:49,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:30:49,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:30:49,799 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 17:30:49,847 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 17:30:49,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:49,996 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 17:30:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569557258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:49,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:30:49,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-08 17:30:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934706898] [2024-11-08 17:30:49,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:30:49,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:30:50,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:30:50,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=461, Unknown=15, NotChecked=44, Total=600 [2024-11-08 17:30:50,002 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 17:30:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:53,342 INFO L93 Difference]: Finished difference Result 923 states and 1073 transitions. [2024-11-08 17:30:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:30:53,343 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 17:30:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:53,346 INFO L225 Difference]: With dead ends: 923 [2024-11-08 17:30:53,346 INFO L226 Difference]: Without dead ends: 923 [2024-11-08 17:30:53,347 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 17:30:53,347 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 697 mSDsluCounter, 6234 mSDsCounter, 0 mSdLazyCounter, 4271 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:53,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 6726 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4271 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 17:30:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-08 17:30:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-08 17:30:53,363 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 17:30:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1068 transitions. [2024-11-08 17:30:53,365 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1068 transitions. Word has length 97 [2024-11-08 17:30:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:53,365 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1068 transitions. [2024-11-08 17:30:53,366 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 17:30:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1068 transitions. [2024-11-08 17:30:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 17:30:53,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:53,367 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 17:30:53,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:53,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:53,570 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 17:30:53,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1270191819, now seen corresponding path program 1 times [2024-11-08 17:30:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:53,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833311134] [2024-11-08 17:30:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:54,821 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 17:30:54,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:54,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833311134] [2024-11-08 17:30:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833311134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:54,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117237325] [2024-11-08 17:30:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:54,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:54,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:54,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:30:54,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:30:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:55,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 17:30:55,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:55,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:30:55,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 8 treesize of output 1 [2024-11-08 17:30:55,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:30:55,234 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 17:30:55,264 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 17:30:55,270 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 17:30:55,367 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 17:30:55,372 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 17:30:55,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:30:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:30:55,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:30:55,621 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:30:55,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:30:55,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:30:55,652 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 17:30:55,657 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 17:30:55,680 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 17:30:55,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:55,966 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 17:30:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117237325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:55,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:30:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-08 17:30:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811425424] [2024-11-08 17:30:55,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:30:55,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:30:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:30:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=495, Unknown=24, NotChecked=46, Total=650 [2024-11-08 17:30:55,971 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 17:30:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:58,183 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2024-11-08 17:30:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:30:58,184 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 17:30:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:58,187 INFO L225 Difference]: With dead ends: 922 [2024-11-08 17:30:58,187 INFO L226 Difference]: Without dead ends: 922 [2024-11-08 17:30:58,187 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 17:30:58,188 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 17:30:58,188 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 17:30:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-08 17:30:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 910. [2024-11-08 17:30:58,203 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 17:30:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1057 transitions. [2024-11-08 17:30:58,205 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1057 transitions. Word has length 97 [2024-11-08 17:30:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:58,205 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1057 transitions. [2024-11-08 17:30:58,206 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 17:30:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1057 transitions. [2024-11-08 17:30:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 17:30:58,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:58,207 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 17:30:58,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 17:30:58,412 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 17:30:58,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1266948618, now seen corresponding path program 1 times [2024-11-08 17:30:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825604553] [2024-11-08 17:30:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:30:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,214 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 17:30:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825604553] [2024-11-08 17:30:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825604553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:59,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:59,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:30:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797788342] [2024-11-08 17:30:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:30:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:30:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:30:59,218 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 17:31:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:00,900 INFO L93 Difference]: Finished difference Result 926 states and 1076 transitions. [2024-11-08 17:31:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:31:00,903 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 17:31:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:00,905 INFO L225 Difference]: With dead ends: 926 [2024-11-08 17:31:00,905 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 17:31:00,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:31:00,906 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 735 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:00,907 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.5s Time] [2024-11-08 17:31:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 17:31:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 922. [2024-11-08 17:31:00,919 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 17:31:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1071 transitions. [2024-11-08 17:31:00,921 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1071 transitions. Word has length 99 [2024-11-08 17:31:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:00,922 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1071 transitions. [2024-11-08 17:31:00,922 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 17:31:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1071 transitions. [2024-11-08 17:31:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 17:31:00,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:00,926 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 17:31:00,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 17:31:00,927 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 17:31:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1266948619, now seen corresponding path program 1 times [2024-11-08 17:31:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299261511] [2024-11-08 17:31:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:01,909 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 17:31:01,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299261511] [2024-11-08 17:31:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299261511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:01,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:31:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130250885] [2024-11-08 17:31:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:01,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:31:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:01,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:31:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:31:01,912 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 17:31:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:03,800 INFO L93 Difference]: Finished difference Result 925 states and 1075 transitions. [2024-11-08 17:31:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:31:03,800 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 17:31:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:03,803 INFO L225 Difference]: With dead ends: 925 [2024-11-08 17:31:03,803 INFO L226 Difference]: Without dead ends: 925 [2024-11-08 17:31:03,803 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 17:31:03,804 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 730 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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 17:31:03,804 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 17:31:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-08 17:31:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2024-11-08 17:31:03,818 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 17:31:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1070 transitions. [2024-11-08 17:31:03,820 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1070 transitions. Word has length 99 [2024-11-08 17:31:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:03,820 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1070 transitions. [2024-11-08 17:31:03,820 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 17:31:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1070 transitions. [2024-11-08 17:31:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:31:03,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:03,822 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 17:31:03,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 17:31:03,822 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 17:31:03,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1623211805, now seen corresponding path program 1 times [2024-11-08 17:31:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473452180] [2024-11-08 17:31:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:04,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:04,631 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 17:31:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473452180] [2024-11-08 17:31:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473452180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527820608] [2024-11-08 17:31:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:04,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:31:04,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:31:04,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:31:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:04,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 17:31:04,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:31:04,966 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 17:31:05,100 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:31:05,101 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 17:31:05,138 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 17:31:05,247 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 17:31:05,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:05,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:05,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:05,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:05,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:05,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 17:31:05,657 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 17:31:05,700 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 17:31:05,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:31:05,714 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 17:31:05,763 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 17:31:05,770 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 17:31:05,805 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 17:31:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527820608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:05,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:31:05,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-08 17:31:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226246399] [2024-11-08 17:31:05,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:31:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:31:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:31:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=509, Unknown=10, NotChecked=196, Total=812 [2024-11-08 17:31:05,810 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 17:31:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:08,922 INFO L93 Difference]: Finished difference Result 924 states and 1074 transitions. [2024-11-08 17:31:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:31:08,922 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 17:31:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:08,925 INFO L225 Difference]: With dead ends: 924 [2024-11-08 17:31:08,925 INFO L226 Difference]: Without dead ends: 924 [2024-11-08 17:31:08,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=693, Unknown=10, NotChecked=228, Total=1056 [2024-11-08 17:31:08,926 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 690 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 4597 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:08,926 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.9s Time] [2024-11-08 17:31:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-08 17:31:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-08 17:31:08,942 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 17:31:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1069 transitions. [2024-11-08 17:31:08,945 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1069 transitions. Word has length 100 [2024-11-08 17:31:08,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:08,945 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1069 transitions. [2024-11-08 17:31:08,945 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 17:31:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1069 transitions. [2024-11-08 17:31:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:31:08,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:08,947 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 17:31:08,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 17:31:09,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:09,149 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 17:31:09,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:09,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1623211806, now seen corresponding path program 1 times [2024-11-08 17:31:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623415332] [2024-11-08 17:31:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:10,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 17:31:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623415332] [2024-11-08 17:31:10,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623415332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059404567] [2024-11-08 17:31:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:31:10,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:31:10,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:31:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:10,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 17:31:10,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:31:10,819 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 17:31:10,951 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 17:31:10,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:31:10,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 17:31:11,003 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 17:31:11,012 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 17:31:11,121 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 17:31:11,127 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 17:31:11,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:11,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:11,257 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 17:31:11,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:11,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:31:11,372 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 17:31:11,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:11,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:11,459 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 17:31:11,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-08 17:31:11,523 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 17:31:11,559 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 17:31:11,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:31:11,850 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 17:31:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059404567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:12,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:31:12,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-08 17:31:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504018434] [2024-11-08 17:31:12,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:31:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:31:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:31:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=737, Unknown=23, NotChecked=56, Total=930 [2024-11-08 17:31:12,321 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 17:31:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:15,565 INFO L93 Difference]: Finished difference Result 923 states and 1073 transitions. [2024-11-08 17:31:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:31:15,565 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 17:31:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:15,567 INFO L225 Difference]: With dead ends: 923 [2024-11-08 17:31:15,567 INFO L226 Difference]: Without dead ends: 923 [2024-11-08 17:31:15,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=1121, Unknown=24, NotChecked=70, Total=1406 [2024-11-08 17:31:15,568 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 17:31:15,568 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 17:31:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-08 17:31:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 908. [2024-11-08 17:31:15,581 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 17:31:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1055 transitions. [2024-11-08 17:31:15,583 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1055 transitions. Word has length 100 [2024-11-08 17:31:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:15,583 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1055 transitions. [2024-11-08 17:31:15,584 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 17:31:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1055 transitions. [2024-11-08 17:31:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 17:31:15,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:15,585 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 17:31:15,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:31:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:15,786 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 17:31:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash -505671932, now seen corresponding path program 1 times [2024-11-08 17:31:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516335548] [2024-11-08 17:31:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:16,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:16,510 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 17:31:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:16,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516335548] [2024-11-08 17:31:16,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516335548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:16,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:31:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414851321] [2024-11-08 17:31:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:16,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:31:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:31:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:31:16,513 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 17:31:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:18,386 INFO L93 Difference]: Finished difference Result 927 states and 1077 transitions. [2024-11-08 17:31:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:31:18,387 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 17:31:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:18,389 INFO L225 Difference]: With dead ends: 927 [2024-11-08 17:31:18,389 INFO L226 Difference]: Without dead ends: 927 [2024-11-08 17:31:18,389 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 17:31:18,389 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 737 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:18,390 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.7s Time] [2024-11-08 17:31:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-08 17:31:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 923. [2024-11-08 17:31:18,403 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 17:31:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1072 transitions. [2024-11-08 17:31:18,405 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1072 transitions. Word has length 102 [2024-11-08 17:31:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:18,406 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1072 transitions. [2024-11-08 17:31:18,406 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 17:31:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1072 transitions. [2024-11-08 17:31:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 17:31:18,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:18,408 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 17:31:18,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 17:31:18,408 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 17:31:18,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash -505671931, now seen corresponding path program 1 times [2024-11-08 17:31:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097196110] [2024-11-08 17:31:18,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:19,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:19,602 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 17:31:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097196110] [2024-11-08 17:31:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097196110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:31:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351870170] [2024-11-08 17:31:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:31:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:31:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:31:19,605 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 17:31:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:21,948 INFO L93 Difference]: Finished difference Result 926 states and 1076 transitions. [2024-11-08 17:31:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:31:21,951 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 17:31:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:21,953 INFO L225 Difference]: With dead ends: 926 [2024-11-08 17:31:21,953 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 17:31:21,953 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 17:31:21,954 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 17:31:21,954 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 17:31:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 17:31:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2024-11-08 17:31:21,966 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 17:31:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1071 transitions. [2024-11-08 17:31:21,968 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1071 transitions. Word has length 102 [2024-11-08 17:31:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:21,968 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1071 transitions. [2024-11-08 17:31:21,969 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 17:31:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1071 transitions. [2024-11-08 17:31:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:31:21,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:21,971 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 17:31:21,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 17:31:21,971 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 17:31:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 66743569, now seen corresponding path program 1 times [2024-11-08 17:31:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597941139] [2024-11-08 17:31:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:22,973 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 17:31:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597941139] [2024-11-08 17:31:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597941139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087956980] [2024-11-08 17:31:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:31:22,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:31:22,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:31:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:23,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 17:31:23,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:31:23,325 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 17:31:23,466 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:31:23,467 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 17:31:23,520 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 17:31:23,656 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 17:31:23,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:23,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 17:31:24,039 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:24,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:24,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:24,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 17:31:24,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 17:31:24,259 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 17:31:24,337 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 17:31:24,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:31:24,349 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 17:31:24,409 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 17:31:24,486 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 17:31:24,500 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 17:31:24,533 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 17:31:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087956980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:24,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:31:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-08 17:31:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881055899] [2024-11-08 17:31:24,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:31:24,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 17:31:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 17:31:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=636, Unknown=16, NotChecked=280, Total=1056 [2024-11-08 17:31:24,538 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 17:31:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:27,482 INFO L93 Difference]: Finished difference Result 925 states and 1075 transitions. [2024-11-08 17:31:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:31:27,483 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 17:31:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:27,485 INFO L225 Difference]: With dead ends: 925 [2024-11-08 17:31:27,485 INFO L226 Difference]: Without dead ends: 925 [2024-11-08 17:31:27,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=843, Unknown=16, NotChecked=320, Total=1332 [2024-11-08 17:31:27,486 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 685 mSDsluCounter, 4796 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:27,486 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.7s Time] [2024-11-08 17:31:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-08 17:31:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2024-11-08 17:31:27,496 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 17:31:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1070 transitions. [2024-11-08 17:31:27,499 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1070 transitions. Word has length 103 [2024-11-08 17:31:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:27,499 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1070 transitions. [2024-11-08 17:31:27,500 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 17:31:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1070 transitions. [2024-11-08 17:31:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:31:27,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:27,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] [2024-11-08 17:31:27,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 17:31:27,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-08 17:31:27,706 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 17:31:27,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash 66743570, now seen corresponding path program 1 times [2024-11-08 17:31:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784174503] [2024-11-08 17:31:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:27,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:29,144 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 17:31:29,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784174503] [2024-11-08 17:31:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784174503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821309837] [2024-11-08 17:31:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:29,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:29,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:31:29,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:31:29,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:31:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:29,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 17:31:29,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:31:29,566 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 17:31:29,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:31:29,716 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 17:31:29,725 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 17:31:29,736 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 17:31:29,743 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 17:31:29,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:31:29,841 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 17:31:29,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:29,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:31:29,985 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 17:31:30,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:30,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:30,104 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 17:31:30,195 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:30,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:30,203 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 17:31:30,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:30,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 17:31:30,309 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 17:31:30,337 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 17:31:30,346 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 17:31:30,352 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 17:31:30,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:31:30,594 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 17:31:30,744 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 17:31:33,085 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 17:31:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821309837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:33,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:31:33,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2024-11-08 17:31:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108276924] [2024-11-08 17:31:33,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:31:33,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:31:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:31:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=599, Unknown=44, NotChecked=162, Total=930 [2024-11-08 17:31:33,095 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 17:31:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:38,890 INFO L93 Difference]: Finished difference Result 924 states and 1074 transitions. [2024-11-08 17:31:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:31:38,892 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 17:31:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:38,895 INFO L225 Difference]: With dead ends: 924 [2024-11-08 17:31:38,895 INFO L226 Difference]: Without dead ends: 924 [2024-11-08 17:31:38,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=206, Invalid=1020, Unknown=46, NotChecked=210, Total=1482 [2024-11-08 17:31:38,897 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 693 mSDsluCounter, 3737 mSDsCounter, 0 mSdLazyCounter, 3663 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:38,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 4230 Invalid, 3678 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 3663 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-08 17:31:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-08 17:31:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 906. [2024-11-08 17:31:38,912 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 17:31:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1053 transitions. [2024-11-08 17:31:38,914 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1053 transitions. Word has length 103 [2024-11-08 17:31:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:38,915 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1053 transitions. [2024-11-08 17:31:38,915 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 17:31:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1053 transitions. [2024-11-08 17:31:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:31:38,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:38,918 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 17:31:38,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 17:31:39,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 17:31:39,119 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 17:31:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1755973062, now seen corresponding path program 1 times [2024-11-08 17:31:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299800778] [2024-11-08 17:31:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:40,613 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 17:31:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299800778] [2024-11-08 17:31:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299800778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:31:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236568185] [2024-11-08 17:31:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:40,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:31:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:31:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:31:40,617 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 17:31:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:45,335 INFO L93 Difference]: Finished difference Result 929 states and 1079 transitions. [2024-11-08 17:31:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:31:45,336 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 17:31:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:45,340 INFO L225 Difference]: With dead ends: 929 [2024-11-08 17:31:45,340 INFO L226 Difference]: Without dead ends: 929 [2024-11-08 17:31:45,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:31:45,342 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 740 mSDsluCounter, 4313 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 4803 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:45,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 4803 Invalid, 3117 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 17:31:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-08 17:31:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 925. [2024-11-08 17:31:45,360 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 17:31:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1074 transitions. [2024-11-08 17:31:45,362 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1074 transitions. Word has length 106 [2024-11-08 17:31:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1074 transitions. [2024-11-08 17:31:45,363 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 17:31:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1074 transitions. [2024-11-08 17:31:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:31:45,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:45,366 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 17:31:45,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 17:31:45,366 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 17:31:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1755973063, now seen corresponding path program 1 times [2024-11-08 17:31:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315892203] [2024-11-08 17:31:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:47,547 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 17:31:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315892203] [2024-11-08 17:31:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315892203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:47,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:31:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528144367] [2024-11-08 17:31:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:47,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:31:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:31:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:31:47,551 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 17:31:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:54,106 INFO L93 Difference]: Finished difference Result 928 states and 1078 transitions. [2024-11-08 17:31:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:31:54,107 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 17:31:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:54,109 INFO L225 Difference]: With dead ends: 928 [2024-11-08 17:31:54,109 INFO L226 Difference]: Without dead ends: 928 [2024-11-08 17:31:54,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:31:54,110 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 735 mSDsluCounter, 4537 mSDsCounter, 0 mSdLazyCounter, 4368 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 6.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:54,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 5028 Invalid, 4386 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 4368 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-08 17:31:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-08 17:31:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 925. [2024-11-08 17:31:54,125 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 17:31:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2024-11-08 17:31:54,127 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 106 [2024-11-08 17:31:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:54,128 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2024-11-08 17:31:54,128 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 17:31:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2024-11-08 17:31:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 17:31:54,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:54,130 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 17:31:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 17:31:54,130 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 17:31:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2032178515, now seen corresponding path program 1 times [2024-11-08 17:31:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173868557] [2024-11-08 17:31:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:31:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:55,480 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 17:31:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173868557] [2024-11-08 17:31:55,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173868557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:55,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135989450] [2024-11-08 17:31:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:55,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:31:55,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:31:55,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:31:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:55,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 17:31:55,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:31:55,905 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 17:31:56,137 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:31:56,137 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 17:31:56,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 19 treesize of output 1 [2024-11-08 17:31:56,339 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 17:31:56,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:56,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:56,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:56,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:56,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:56,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:56,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:56,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:57,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:31:57,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:31:57,126 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 17:31:57,268 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-08 17:31:57,269 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 17:31:57,280 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 17:31:57,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:31:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135989450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:58,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:31:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-08 17:31:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117404460] [2024-11-08 17:31:58,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:31:58,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 17:31:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 17:31:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1169, Unknown=46, NotChecked=0, Total=1406 [2024-11-08 17:31:58,746 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 17:32:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:04,452 INFO L93 Difference]: Finished difference Result 927 states and 1077 transitions. [2024-11-08 17:32:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:32:04,455 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 17:32:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:04,457 INFO L225 Difference]: With dead ends: 927 [2024-11-08 17:32:04,457 INFO L226 Difference]: Without dead ends: 927 [2024-11-08 17:32:04,458 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 17:32:04,458 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 678 mSDsluCounter, 6192 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:04,460 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.3s Time] [2024-11-08 17:32:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-08 17:32:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 924. [2024-11-08 17:32:04,475 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 17:32:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1072 transitions. [2024-11-08 17:32:04,476 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1072 transitions. Word has length 107 [2024-11-08 17:32:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:04,477 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1072 transitions. [2024-11-08 17:32:04,477 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 17:32:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1072 transitions. [2024-11-08 17:32:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 17:32:04,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:04,478 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 17:32:04,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:32:04,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-08 17:32:04,679 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 17:32:04,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2032178516, now seen corresponding path program 1 times [2024-11-08 17:32:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:32:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880934083] [2024-11-08 17:32:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:32:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:32:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,132 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 17:32:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:32:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880934083] [2024-11-08 17:32:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880934083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:32:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111154552] [2024-11-08 17:32:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:32:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:32:06,134 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:32:06,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:32:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 17:32:06,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:32:06,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:32:06,675 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 17:32:06,697 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:32:06,698 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 17:32:06,766 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 17:32:06,777 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 17:32:06,980 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 17:32:06,986 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 17:32:07,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:32:07,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:32:07,305 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 17:32:07,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:32:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:32:07,505 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 17:32:07,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:32:07,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:32:07,706 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 17:32:07,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:32:07,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 17:32:07,901 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 17:32:08,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:32:08,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 17:32:08,075 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 17:32:08,120 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 17:32:08,128 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 17:32:08,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:32:08,254 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 17:32:08,286 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 17:32:08,286 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 17:32:08,356 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 17:32:08,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:32:09,152 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 17:32:10,150 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 17:32:23,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111154552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:32:23,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:32:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-08 17:32:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976993709] [2024-11-08 17:32:23,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:32:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 17:32:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:32:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 17:32:23,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1351, Unknown=40, NotChecked=154, Total=1722 [2024-11-08 17:32:23,241 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 17:32:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:55,831 INFO L93 Difference]: Finished difference Result 926 states and 1076 transitions. [2024-11-08 17:32:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:32:55,832 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 17:32:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:55,834 INFO L225 Difference]: With dead ends: 926 [2024-11-08 17:32:55,834 INFO L226 Difference]: Without dead ends: 926 [2024-11-08 17:32:55,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=309, Invalid=2209, Unknown=40, NotChecked=198, Total=2756 [2024-11-08 17:32:55,836 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 691 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 5129 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s 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, 29.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:55,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 5819 Invalid, 5153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5129 Invalid, 0 Unknown, 0 Unchecked, 29.8s Time] [2024-11-08 17:32:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-08 17:32:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 904. [2024-11-08 17:32:55,844 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 17:32:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1051 transitions. [2024-11-08 17:32:55,846 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1051 transitions. Word has length 107 [2024-11-08 17:32:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1051 transitions. [2024-11-08 17:32:55,847 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 17:32:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1051 transitions. [2024-11-08 17:32:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:32:55,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:55,848 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 17:32:55,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 17:32:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-08 17:32:56,050 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 17:32:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -507513865, now seen corresponding path program 1 times [2024-11-08 17:32:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:32:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455818628] [2024-11-08 17:32:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:32:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:32:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:56,927 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 17:32:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:32:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455818628] [2024-11-08 17:32:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455818628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:32:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:32:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:32:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598612590] [2024-11-08 17:32:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:32:56,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:32:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:32:56,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:32:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:32:56,930 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 17:33:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:33:03,534 INFO L93 Difference]: Finished difference Result 909 states and 1059 transitions. [2024-11-08 17:33:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:33:03,535 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 17:33:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:33:03,538 INFO L225 Difference]: With dead ends: 909 [2024-11-08 17:33:03,538 INFO L226 Difference]: Without dead ends: 909 [2024-11-08 17:33:03,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:33:03,539 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 6 mSDsluCounter, 2881 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:33:03,540 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.5s Time] [2024-11-08 17:33:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-08 17:33:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 903. [2024-11-08 17:33:03,556 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 17:33:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1050 transitions. [2024-11-08 17:33:03,559 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1050 transitions. Word has length 109 [2024-11-08 17:33:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:33:03,559 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1050 transitions. [2024-11-08 17:33:03,560 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 17:33:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1050 transitions. [2024-11-08 17:33:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:33:03,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:33:03,561 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 17:33:03,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 17:33:03,562 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 17:33:03,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:33:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -507513864, now seen corresponding path program 1 times [2024-11-08 17:33:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:33:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855238597] [2024-11-08 17:33:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:33:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:33:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:33:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:08,537 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 17:33:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:33:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855238597] [2024-11-08 17:33:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855238597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:33:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:33:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:33:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751342768] [2024-11-08 17:33:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:33:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:33:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:33:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:33:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:33:08,541 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 17:33:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:33:42,790 INFO L93 Difference]: Finished difference Result 928 states and 1078 transitions. [2024-11-08 17:33:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:33:42,791 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 17:33:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:33:42,792 INFO L225 Difference]: With dead ends: 928 [2024-11-08 17:33:42,792 INFO L226 Difference]: Without dead ends: 928 [2024-11-08 17:33:42,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-08 17:33:42,793 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 712 mSDsluCounter, 4847 mSDsCounter, 0 mSdLazyCounter, 4883 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s 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, 32.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:33:42,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 5337 Invalid, 4897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 4883 Invalid, 0 Unknown, 0 Unchecked, 32.0s Time] [2024-11-08 17:33:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-08 17:33:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 925. [2024-11-08 17:33:42,802 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 17:33:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2024-11-08 17:33:42,804 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 109 [2024-11-08 17:33:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:33:42,804 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2024-11-08 17:33:42,804 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 17:33:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2024-11-08 17:33:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 17:33:42,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:33:42,805 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 17:33:42,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 17:33:42,806 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 17:33:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:33:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1228202677, now seen corresponding path program 1 times [2024-11-08 17:33:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:33:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850892909] [2024-11-08 17:33:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:33:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:33:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:33:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:47,334 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 17:33:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:33:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850892909] [2024-11-08 17:33:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850892909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:33:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993963851] [2024-11-08 17:33:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:33:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:33:47,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:33:47,337 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:33:47,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:33:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:47,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 17:33:47,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:33:47,777 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 17:33:48,659 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 17:33:48,842 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:33:48,842 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 17:33:49,193 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 17:33:49,235 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 17:33:50,052 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 17:33:50,071 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 17:33:51,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:33:51,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:33:51,099 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 17:33:51,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:33:51,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:33:51,918 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 17:33:52,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:33:52,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:33:52,489 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 17:33:53,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:33:53,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:33:53,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:33:54,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:33:54,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-08 17:33:54,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:33:54,706 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-08 17:33:54,706 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 17:33:54,725 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 17:33:55,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:33:55,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:33:55,155 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 17:33:55,490 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 17:33:55,516 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 17:33:55,758 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 17:33:55,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:33:56,288 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 17:34:25,936 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_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 (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 ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3263))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3266))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3268))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3270))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3264) .cse1 v_ArrVal_3265) .cse2 v_ArrVal_3267) .cse3 v_ArrVal_3269) .cse4 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse6 .cse4 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (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 (+ 40 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3263))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3266))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3268))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3264) .cse10 v_ArrVal_3265) .cse11 v_ArrVal_3267) .cse12 v_ArrVal_3269) (select (select (store .cse13 .cse12 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3273))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (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))))))) is different from false [2024-11-08 17:34:26,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (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_3278 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3279 (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 ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3279))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3263))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3266))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3268))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3270))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3278) .cse0 v_ArrVal_3264) .cse1 v_ArrVal_3265) .cse2 v_ArrVal_3267) .cse3 v_ArrVal_3269) .cse4 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse6 .cse4 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (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_3278 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3279 (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 ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3279))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_3263))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3266))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3268))) (let ((.cse14 (select (select .cse15 |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~mem54#1.base| v_ArrVal_3278) .cse11 v_ArrVal_3264) .cse12 v_ArrVal_3265) .cse13 v_ArrVal_3267) .cse14 v_ArrVal_3269) (select (select (store .cse15 .cse14 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3273))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (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)))))) is different from false [2024-11-08 17:34:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993963851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:34:26,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:34:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2024-11-08 17:34:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601364922] [2024-11-08 17:34:26,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:34:26,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 17:34:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:34:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 17:34:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1612, Unknown=55, NotChecked=258, Total=2162 [2024-11-08 17:34:26,694 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 17:35:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:26,491 INFO L93 Difference]: Finished difference Result 927 states and 1077 transitions. [2024-11-08 17:35:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:35:26,491 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 17:35:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:26,494 INFO L225 Difference]: With dead ends: 927 [2024-11-08 17:35:26,494 INFO L226 Difference]: Without dead ends: 927 [2024-11-08 17:35:26,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=393, Invalid=2644, Unknown=55, NotChecked=330, Total=3422 [2024-11-08 17:35:26,496 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 680 mSDsluCounter, 5794 mSDsCounter, 0 mSdLazyCounter, 5412 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.8s 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, 54.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:26,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 6282 Invalid, 5432 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5412 Invalid, 0 Unknown, 0 Unchecked, 54.9s Time] [2024-11-08 17:35:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-08 17:35:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 902. [2024-11-08 17:35:26,509 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 17:35:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1049 transitions. [2024-11-08 17:35:26,511 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1049 transitions. Word has length 110 [2024-11-08 17:35:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1049 transitions. [2024-11-08 17:35:26,512 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 17:35:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1049 transitions. [2024-11-08 17:35:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:35:26,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:26,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:35:26,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 17:35:26,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-08 17:35:26,715 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 17:35:26,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1060001971, now seen corresponding path program 1 times [2024-11-08 17:35:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862324700] [2024-11-08 17:35:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:35:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:30,191 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 17:35:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862324700] [2024-11-08 17:35:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862324700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:30,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:30,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:35:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143705880] [2024-11-08 17:35:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:30,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:35:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:30,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:35:30,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:35:30,194 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 17:36:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:08,636 INFO L93 Difference]: Finished difference Result 953 states and 1105 transitions. [2024-11-08 17:36:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:36:08,636 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 17:36:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:08,638 INFO L225 Difference]: With dead ends: 953 [2024-11-08 17:36:08,638 INFO L226 Difference]: Without dead ends: 953 [2024-11-08 17:36:08,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:36:08,639 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 785 mSDsluCounter, 6241 mSDsCounter, 0 mSdLazyCounter, 4241 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.9s 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, 36.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:08,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 6731 Invalid, 4262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4241 Invalid, 0 Unknown, 0 Unchecked, 36.6s Time] [2024-11-08 17:36:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-08 17:36:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2024-11-08 17:36:08,651 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 17:36:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1076 transitions. [2024-11-08 17:36:08,653 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1076 transitions. Word has length 112 [2024-11-08 17:36:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1076 transitions. [2024-11-08 17:36:08,654 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 17:36:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1076 transitions. [2024-11-08 17:36:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:36:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:08,655 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 17:36:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 17:36:08,656 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 17:36:08,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1060001970, now seen corresponding path program 1 times [2024-11-08 17:36:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:36:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060997150] [2024-11-08 17:36:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:36:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:36:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:36:13,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:36:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060997150] [2024-11-08 17:36:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060997150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:13,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:36:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528334737] [2024-11-08 17:36:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:13,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:36:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:36:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:36:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:36:13,367 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 17:36:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:51,671 INFO L93 Difference]: Finished difference Result 952 states and 1104 transitions. [2024-11-08 17:36:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:36:51,672 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 17:36:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:51,676 INFO L225 Difference]: With dead ends: 952 [2024-11-08 17:36:51,676 INFO L226 Difference]: Without dead ends: 952 [2024-11-08 17:36:51,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:36:51,677 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 796 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s 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, 36.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:51,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 5521 Invalid, 3898 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 36.3s Time] [2024-11-08 17:36:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-11-08 17:36:51,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 927. [2024-11-08 17:36:51,695 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 17:36:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1075 transitions. [2024-11-08 17:36:51,697 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1075 transitions. Word has length 112 [2024-11-08 17:36:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:51,698 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1075 transitions. [2024-11-08 17:36:51,698 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 17:36:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1075 transitions. [2024-11-08 17:36:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 17:36:51,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:51,700 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 17:36:51,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 17:36:51,701 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 17:36:51,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -558917350, now seen corresponding path program 1 times [2024-11-08 17:36:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:36:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220481416] [2024-11-08 17:36:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:36:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:36:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:56,734 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 17:36:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:36:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220481416] [2024-11-08 17:36:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220481416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:36:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122646269] [2024-11-08 17:36:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:56,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:36:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:36:56,737 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:36:56,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 17:36:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:57,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 17:36:57,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:57,253 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 17:36:58,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:36:58,787 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 17:36:58,835 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 17:36:59,339 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:36:59,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-08 17:36:59,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:36:59,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:37:00,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:00,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 31 treesize of output 32 [2024-11-08 17:37:01,055 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:01,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:37:01,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:01,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:37:01,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:01,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:37:02,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:02,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-08 17:37:02,864 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 17:37:02,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 17:37:02,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:37:03,654 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 17:37:03,796 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-08 17:37:03,797 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 17:37:03,839 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 17:37:05,129 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 ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |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 17:37:05,220 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 17:37:05,286 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 17:37:05,371 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| |c_ULTIMATE.start_main_#t~mem57#1.base| 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 17:37:05,427 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 17:37:05,531 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 17:37:09,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122646269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:37:09,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:37:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 24 [2024-11-08 17:37:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282431827] [2024-11-08 17:37:09,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:37:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 17:37:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 17:37:09,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=730, Unknown=42, NotChecked=504, Total=1406 [2024-11-08 17:37:09,539 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 17:37:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:51,935 INFO L93 Difference]: Finished difference Result 943 states and 1093 transitions. [2024-11-08 17:37:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:37:51,935 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 17:37:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:51,937 INFO L225 Difference]: With dead ends: 943 [2024-11-08 17:37:51,937 INFO L226 Difference]: Without dead ends: 943 [2024-11-08 17:37:51,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=239, Invalid=1391, Unknown=42, NotChecked=680, Total=2352 [2024-11-08 17:37:51,938 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 758 mSDsluCounter, 6717 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.7s 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, 39.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:51,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 7207 Invalid, 4563 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 39.5s Time] [2024-11-08 17:37:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-08 17:37:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 926. [2024-11-08 17:37:51,949 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 17:37:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1074 transitions. [2024-11-08 17:37:51,951 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1074 transitions. Word has length 113 [2024-11-08 17:37:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:51,951 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1074 transitions. [2024-11-08 17:37:51,952 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 17:37:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1074 transitions. [2024-11-08 17:37:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 17:37:51,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:51,953 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 17:37:51,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 17:37:52,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-08 17:37:52,154 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 17:37:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -558917349, now seen corresponding path program 1 times [2024-11-08 17:37:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709463442] [2024-11-08 17:37:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:37:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:56,398 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 17:37:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709463442] [2024-11-08 17:37:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709463442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:37:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067399376] [2024-11-08 17:37:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:56,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:37:56,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:37:56,399 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:37:56,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:37:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:56,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 17:37:56,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:37:56,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:37:57,830 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:37:57,830 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 17:37:57,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:37:57,897 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 17:37:58,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 17:37:58,548 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 17:37:59,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:59,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:37:59,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:37:59,621 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:37:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 17:37:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-08 17:38:00,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:38:00,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 17:38:00,198 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 17:38:00,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:38:00,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 17:38:00,763 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 17:38:01,371 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:38:01,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:38:01,391 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 17:38:02,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:38:02,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:38:02,472 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 17:38:02,594 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 17:38:02,613 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 17:38:02,930 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 17:38:02,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:38:03,713 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 17:38:03,772 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 17:38:03,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:38:03,896 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 17:38:04,133 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 17:38:05,206 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 17:38:06,382 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 17:38:06,514 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 (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 ((.cse5 (store |c_#memory_$Pointer$#1.base| .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 |c_#memory_$Pointer$#1.offset| .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_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 ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3927))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3929))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3926) .cse6 v_ArrVal_3928) .cse7 v_prenex_44) (select (select (store .cse8 .cse7 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_45))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (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 ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3927))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3929)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3930))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse12))))))) is different from false [2024-11-08 17:38:06,740 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 17:38:12,829 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 17:38:18,174 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 17:38:24,111 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 17:38:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067399376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:38:24,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:38:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 27 [2024-11-08 17:38:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111099963] [2024-11-08 17:38:24,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:38:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 17:38:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 17:38:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=888, Unknown=44, NotChecked=710, Total=1806 [2024-11-08 17:38:24,134 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 17:39:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:39:45,605 INFO L93 Difference]: Finished difference Result 942 states and 1092 transitions. [2024-11-08 17:39:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:39:45,606 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 17:39:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:39:45,610 INFO L225 Difference]: With dead ends: 942 [2024-11-08 17:39:45,610 INFO L226 Difference]: Without dead ends: 942 [2024-11-08 17:39:45,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=298, Invalid=1677, Unknown=45, NotChecked=950, Total=2970 [2024-11-08 17:39:45,612 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 767 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.5s 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, 76.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:39:45,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 7710 Invalid, 5627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 76.6s Time] [2024-11-08 17:39:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-08 17:39:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 900. [2024-11-08 17:39:45,629 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 17:39:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1047 transitions. [2024-11-08 17:39:45,631 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1047 transitions. Word has length 113 [2024-11-08 17:39:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:39:45,632 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1047 transitions. [2024-11-08 17:39:45,632 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 17:39:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1047 transitions. [2024-11-08 17:39:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 17:39:45,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:39:45,634 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 17:39:45,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 17:39:45,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-08 17:39:45,857 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 17:39:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:39:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1918469685, now seen corresponding path program 1 times [2024-11-08 17:39:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:39:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243993940] [2024-11-08 17:39:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:39:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:39:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:39:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:39:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:39:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:39:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:39:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243993940] [2024-11-08 17:39:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243993940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:39:46,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:39:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:39:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847908318] [2024-11-08 17:39:46,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:39:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:39:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:39:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:39:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:39:46,627 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 17:39:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:39:59,529 INFO L93 Difference]: Finished difference Result 919 states and 1069 transitions. [2024-11-08 17:39:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:39:59,530 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 17:39:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:39:59,533 INFO L225 Difference]: With dead ends: 919 [2024-11-08 17:39:59,533 INFO L226 Difference]: Without dead ends: 919 [2024-11-08 17:39:59,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:39:59,534 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 22 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s 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, 12.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:39:59,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2980 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-08 17:39:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-08 17:39:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 899. [2024-11-08 17:39:59,549 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 17:39:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1046 transitions. [2024-11-08 17:39:59,552 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1046 transitions. Word has length 115 [2024-11-08 17:39:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:39:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1046 transitions. [2024-11-08 17:39:59,553 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 17:39:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1046 transitions. [2024-11-08 17:39:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 17:39:59,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:39:59,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:39:59,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 17:39:59,555 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 17:39:59,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:39:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1918469684, now seen corresponding path program 1 times [2024-11-08 17:39:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:39:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549186827] [2024-11-08 17:39:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:39:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:39:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:40:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:40:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:40:00,818 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 17:40:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:40:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549186827] [2024-11-08 17:40:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549186827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:40:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:40:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:40:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419208705] [2024-11-08 17:40:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:40:00,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:40:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:40:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:40:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:40:00,823 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 17:40:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:40:15,132 INFO L93 Difference]: Finished difference Result 918 states and 1068 transitions. [2024-11-08 17:40:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:40:15,133 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 17:40:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:40:15,136 INFO L225 Difference]: With dead ends: 918 [2024-11-08 17:40:15,136 INFO L226 Difference]: Without dead ends: 918 [2024-11-08 17:40:15,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:40:15,137 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 21 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s 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, 14.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:40:15,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2960 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2024-11-08 17:40:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-08 17:40:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 898. [2024-11-08 17:40:15,152 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 17:40:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1045 transitions. [2024-11-08 17:40:15,154 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1045 transitions. Word has length 115 [2024-11-08 17:40:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:40:15,155 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1045 transitions. [2024-11-08 17:40:15,155 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 17:40:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1045 transitions. [2024-11-08 17:40:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:40:15,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:40:15,157 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 17:40:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 17:40:15,157 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 17:40:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:40:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 656982609, now seen corresponding path program 1 times [2024-11-08 17:40:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:40:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79253965] [2024-11-08 17:40:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:40:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:40:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:40:23,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:40:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:40:23,816 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 17:40:23,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:40:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79253965] [2024-11-08 17:40:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79253965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:40:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:40:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 17:40:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088538449] [2024-11-08 17:40:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:40:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:40:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:40:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:40:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:40:23,820 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 17:41:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:41:22,803 INFO L93 Difference]: Finished difference Result 946 states and 1098 transitions. [2024-11-08 17:41:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:41:22,804 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 17:41:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:41:22,808 INFO L225 Difference]: With dead ends: 946 [2024-11-08 17:41:22,808 INFO L226 Difference]: Without dead ends: 946 [2024-11-08 17:41:22,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:41:22,809 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 770 mSDsluCounter, 5800 mSDsCounter, 0 mSdLazyCounter, 4074 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.9s 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, 54.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:41:22,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 6296 Invalid, 4093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 4074 Invalid, 0 Unknown, 0 Unchecked, 54.8s Time] [2024-11-08 17:41:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-11-08 17:41:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 927. [2024-11-08 17:41:22,832 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 17:41:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1077 transitions. [2024-11-08 17:41:22,835 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1077 transitions. Word has length 116 [2024-11-08 17:41:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:41:22,835 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1077 transitions. [2024-11-08 17:41:22,835 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 17:41:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1077 transitions. [2024-11-08 17:41:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:41:22,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:41:22,837 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 17:41:22,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-08 17:41:22,837 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 17:41:22,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:41:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash 656982610, now seen corresponding path program 1 times [2024-11-08 17:41:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:41:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771527591] [2024-11-08 17:41:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:41:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:41:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:41:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:30,431 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 17:41:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:41:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771527591] [2024-11-08 17:41:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771527591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:41:30,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:41:30,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 17:41:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401929837] [2024-11-08 17:41:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:41:30,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:41:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:41:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:41:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:41:30,433 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 17:42:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:42:48,641 INFO L93 Difference]: Finished difference Result 945 states and 1097 transitions. [2024-11-08 17:42:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:42:48,643 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 17:42:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:42:48,646 INFO L225 Difference]: With dead ends: 945 [2024-11-08 17:42:48,646 INFO L226 Difference]: Without dead ends: 945 [2024-11-08 17:42:48,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:42:48,647 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 749 mSDsluCounter, 6183 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.5s 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, 73.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:42:48,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 6677 Invalid, 5264 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 73.6s Time] [2024-11-08 17:42:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-08 17:42:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 927. [2024-11-08 17:42:48,663 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 17:42:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1076 transitions. [2024-11-08 17:42:48,665 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1076 transitions. Word has length 116 [2024-11-08 17:42:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:42:48,666 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1076 transitions. [2024-11-08 17:42:48,666 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 17:42:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1076 transitions. [2024-11-08 17:42:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:42:48,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:42:48,668 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 17:42:48,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-08 17:42:48,669 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 17:42:48,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:42:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1575945630, now seen corresponding path program 1 times [2024-11-08 17:42:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:42:48,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265130511] [2024-11-08 17:42:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:42:48,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:42:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:42:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:57,740 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 17:42:57,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:42:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265130511] [2024-11-08 17:42:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265130511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:42:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174216147] [2024-11-08 17:42:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:42:57,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:42:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:42:57,742 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:42:57,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 17:42:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:58,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-08 17:42:58,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:42:58,220 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 17:42:59,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:42:59,949 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 17:43:00,342 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 17:43:00,375 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 17:43:01,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:43:01,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:43:01,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-08 17:43:02,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:43:02,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-08 17:43:02,609 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 17:43:03,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:43:03,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:43:03,504 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 17:43:04,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:43:04,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:43:04,370 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 17:43:05,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:43:05,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 17:43:05,292 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 17:43:06,097 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 17:43:07,051 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-08 17:43:07,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-08 17:43:07,085 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 17:43:08,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:43:08,888 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-08 17:43:08,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 17:43:08,937 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 17:43:09,169 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 17:43:09,745 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-08 17:43:09,746 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 17:43:09,770 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 17:43:09,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:43:10,030 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 17:43:15,301 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 17:43:15,361 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 17:43:15,471 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 17:43:15,595 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 17:43:15,939 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 ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4558)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| 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 17:43:16,264 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 17:43:19,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-08 17:43:19,695 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/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 17:43:19,696 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 17:43:19,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 17:43:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-08 17:43:19,897 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_5fafebfe-b630-4392-86cd-58ca5e12b314/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 17:43:19,901 INFO L158 Benchmark]: Toolchain (without parser) took 799951.32ms. Allocated memory was 132.1MB in the beginning and 616.6MB in the end (delta: 484.4MB). Free memory was 91.8MB in the beginning and 517.2MB in the end (delta: -425.5MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-11-08 17:43:19,901 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:43:19,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1302.23ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 91.4MB in the beginning and 116.1MB in the end (delta: -24.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-08 17:43:19,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 208.12ms. Allocated memory is still 159.4MB. Free memory was 116.1MB in the beginning and 107.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 17:43:19,902 INFO L158 Benchmark]: Boogie Preprocessor took 263.82ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:43:19,902 INFO L158 Benchmark]: RCFGBuilder took 3717.23ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 93.0MB in the beginning and 120.3MB in the end (delta: -27.2MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-11-08 17:43:19,902 INFO L158 Benchmark]: TraceAbstraction took 794450.54ms. Allocated memory was 203.4MB in the beginning and 616.6MB in the end (delta: 413.1MB). Free memory was 120.3MB in the beginning and 517.2MB in the end (delta: -397.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-08 17:43:19,904 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.36ms. Allocated memory is still 132.1MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1302.23ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 91.4MB in the beginning and 116.1MB in the end (delta: -24.7MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 208.12ms. Allocated memory is still 159.4MB. Free memory was 116.1MB in the beginning and 107.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 263.82ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3717.23ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 93.0MB in the beginning and 120.3MB in the end (delta: -27.2MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 794450.54ms. Allocated memory was 203.4MB in the beginning and 616.6MB in the end (delta: 413.1MB). Free memory was 120.3MB in the beginning and 517.2MB in the end (delta: -397.0MB). Peak memory consumption was 17.7MB. 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_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/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 17:43:22,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:43:22,112 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 17:43:22,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:43:22,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:43:22,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:43:22,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:43:22,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:43:22,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:43:22,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:43:22,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:43:22,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:43:22,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:43:22,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:43:22,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:43:22,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:43:22,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:43:22,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:43:22,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:43:22,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:43:22,190 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:43:22,191 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:43:22,192 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:43:22,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:43:22,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:43:22,193 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:43:22,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:43:22,194 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:43:22,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:43:22,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:43:22,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:43:22,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:43:22,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:43:22,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:43:22,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:43:22,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:43:22,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:43:22,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:43:22,197 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:43:22,198 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:43:22,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:43:22,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:43:22,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:43:22,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:43:22,201 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_5fafebfe-b630-4392-86cd-58ca5e12b314/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_5fafebfe-b630-4392-86cd-58ca5e12b314/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 17:43:22,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:43:22,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:43:22,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:43:22,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:43:22,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:43:22,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i Unable to find full path for "g++" [2024-11-08 17:43:24,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:43:25,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:43:25,384 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-11-08 17:43:25,403 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data/bc5604503/9cfe13c87d5c4b3a9a514d0f5de78989/FLAG0d6775664 [2024-11-08 17:43:25,524 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/data/bc5604503/9cfe13c87d5c4b3a9a514d0f5de78989 [2024-11-08 17:43:25,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:43:25,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:43:25,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:43:25,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:43:25,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:43:25,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:43:25" (1/1) ... [2024-11-08 17:43:25,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cfde25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:25, skipping insertion in model container [2024-11-08 17:43:25,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:43:25" (1/1) ... [2024-11-08 17:43:25,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:43:26,179 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 17:43:26,242 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 17:43:26,254 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 17:43:26,264 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 17:43:26,278 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 17:43:26,350 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 17:43:26,355 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 17:43:26,363 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 17:43:26,364 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 17:43:26,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:43:26,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:43:26,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:43:26,675 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:43:26,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26 WrapperNode [2024-11-08 17:43:26,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:43:26,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:43:26,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:43:26,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:43:26,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,804 INFO L138 Inliner]: procedures = 210, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 862 [2024-11-08 17:43:26,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:43:26,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:43:26,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:43:26,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:43:26,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,893 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 17:43:26,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:26,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:27,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:43:27,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:43:27,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:43:27,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:43:27,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (1/1) ... [2024-11-08 17:43:27,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:43:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:27,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:43:27,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:43:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:43:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:43:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:43:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:43:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:43:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:43:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 17:43:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 17:43:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-08 17:43:27,090 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 17:43:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 17:43:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-08 17:43:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 17:43:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:43:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:43:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 17:43:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:43:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:43:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:43:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:43:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:43:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:43:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:43:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:43:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:43:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:43:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:43:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 17:43:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:43:27,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:43:27,379 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:43:27,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:43:27,386 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:43:27,461 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:43:27,512 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:43:31,853 INFO L? ?]: Removed 866 outVars from TransFormulas that were not future-live. [2024-11-08 17:43:31,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:43:31,925 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:43:31,929 INFO L316 CfgBuilder]: Removed 50 assume(true) statements. [2024-11-08 17:43:31,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:31 BoogieIcfgContainer [2024-11-08 17:43:31,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:43:31,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:43:31,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:43:31,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:43:31,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:43:25" (1/3) ... [2024-11-08 17:43:31,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a34fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:43:31, skipping insertion in model container [2024-11-08 17:43:31,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:26" (2/3) ... [2024-11-08 17:43:31,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a34fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:43:31, skipping insertion in model container [2024-11-08 17:43:31,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:31" (3/3) ... [2024-11-08 17:43:31,942 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2024-11-08 17:43:31,958 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:43:31,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-08 17:43:32,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:43:32,048 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;@793ba6ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:43:32,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-08 17:43:32,056 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 17:43:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:43:32,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:32,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:43:32,065 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 17:43:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1758111, now seen corresponding path program 1 times [2024-11-08 17:43:32,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417079222] [2024-11-08 17:43:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:32,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:32,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:32,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:43:32,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:43:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:32,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:43:32,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:32,403 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 17:43:32,404 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 17:43:32,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:32,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417079222] [2024-11-08 17:43:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417079222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:43:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477962089] [2024-11-08 17:43:32,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:43:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:43:32,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-08 17:43:32,457 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 17:43:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:34,890 INFO L93 Difference]: Finished difference Result 1068 states and 1154 transitions. [2024-11-08 17:43:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:43:34,893 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 17:43:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:34,913 INFO L225 Difference]: With dead ends: 1068 [2024-11-08 17:43:34,917 INFO L226 Difference]: Without dead ends: 1065 [2024-11-08 17:43:34,919 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 17:43:34,922 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 237 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:34,923 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.3s Time] [2024-11-08 17:43:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-08 17:43:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 851. [2024-11-08 17:43:35,030 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 17:43:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 901 transitions. [2024-11-08 17:43:35,037 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 901 transitions. Word has length 4 [2024-11-08 17:43:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:35,037 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 901 transitions. [2024-11-08 17:43:35,041 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 17:43:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 901 transitions. [2024-11-08 17:43:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:43:35,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:35,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:43:35,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:43:35,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:35,247 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 17:43:35,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-08 17:43:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749212458] [2024-11-08 17:43:35,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:35,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:35,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:35,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:43:35,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:43:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:35,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:43:35,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:35,430 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 17:43:35,443 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 17:43:35,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:35,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749212458] [2024-11-08 17:43:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749212458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:43:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604947245] [2024-11-08 17:43:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:35,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:43:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:43:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:35,448 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 17:43:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:37,104 INFO L93 Difference]: Finished difference Result 848 states and 899 transitions. [2024-11-08 17:43:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:43:37,105 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 17:43:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:37,108 INFO L225 Difference]: With dead ends: 848 [2024-11-08 17:43:37,108 INFO L226 Difference]: Without dead ends: 848 [2024-11-08 17:43:37,109 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 17:43:37,110 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 783 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:37,110 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.6s Time] [2024-11-08 17:43:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-08 17:43:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2024-11-08 17:43:37,139 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 17:43:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 899 transitions. [2024-11-08 17:43:37,143 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 899 transitions. Word has length 4 [2024-11-08 17:43:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 899 transitions. [2024-11-08 17:43:37,144 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 17:43:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 899 transitions. [2024-11-08 17:43:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:43:37,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:37,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:43:37,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:43:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:37,346 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 17:43:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-08 17:43:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165083090] [2024-11-08 17:43:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:37,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:43:37,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:43:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:37,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:43:37,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:37,487 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 17:43:37,547 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 17:43:37,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:37,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165083090] [2024-11-08 17:43:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165083090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:43:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512069751] [2024-11-08 17:43:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:37,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:43:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:43:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:37,553 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 17:43:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:39,893 INFO L93 Difference]: Finished difference Result 1061 states and 1135 transitions. [2024-11-08 17:43:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:43:39,894 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 17:43:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:39,897 INFO L225 Difference]: With dead ends: 1061 [2024-11-08 17:43:39,898 INFO L226 Difference]: Without dead ends: 1061 [2024-11-08 17:43:39,898 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 17:43:39,899 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 236 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:39,900 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.3s Time] [2024-11-08 17:43:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-08 17:43:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 975. [2024-11-08 17:43:39,920 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 17:43:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1132 transitions. [2024-11-08 17:43:39,924 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1132 transitions. Word has length 4 [2024-11-08 17:43:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:39,924 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1132 transitions. [2024-11-08 17:43:39,925 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 17:43:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1132 transitions. [2024-11-08 17:43:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:43:39,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:39,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:39,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:43:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:40,127 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 17:43:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-08 17:43:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784095446] [2024-11-08 17:43:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:40,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:40,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:40,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:43:40,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fafebfe-b630-4392-86cd-58ca5e12b314/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:43:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:40,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:43:40,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:40,300 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 17:43:40,310 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 17:43:40,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:43:40,435 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 17:43:40,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:43:40,449 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 17:43:40,500 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 17:43:40,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:40,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:40,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784095446] [2024-11-08 17:43:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784095446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:40,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:43:40,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088896979] [2024-11-08 17:43:40,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:40,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:43:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:43:40,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:43:40,503 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)