./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd --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 c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:04:29,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:04:29,897 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 16:04:29,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:04:29,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:04:29,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:04:29,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:04:29,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:04:29,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:04:29,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:04:29,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:04:29,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:04:29,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:04:29,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:04:29,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:04:29,934 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:04:29,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:04:29,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:04:29,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:04:29,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd 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 -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2024-11-13 16:04:30,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:04:30,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:04:30,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:04:30,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:04:30,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:04:30,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i Unable to find full path for "g++" [2024-11-13 16:04:32,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:04:32,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:04:32,669 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2024-11-13 16:04:32,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/data/b28192c2e/de8604f078f24593a6a50a5e7df17f35/FLAGb84fc7a33 [2024-11-13 16:04:32,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/data/b28192c2e/de8604f078f24593a6a50a5e7df17f35 [2024-11-13 16:04:32,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:04:32,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:04:32,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:04:32,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:04:32,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:04:32,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:04:32" (1/1) ... [2024-11-13 16:04:32,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45663958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:32, skipping insertion in model container [2024-11-13 16:04:32,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:04:32" (1/1) ... [2024-11-13 16:04:32,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:04:33,515 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-13 16:04:33,575 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-13 16:04:33,583 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-13 16:04:33,591 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-13 16:04:33,606 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-13 16:04:33,673 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-13 16:04:33,679 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-13 16:04:33,683 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-13 16:04:33,695 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-13 16:04:33,727 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-13 16:04:33,727 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-13 16:04:33,730 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-13 16:04:33,730 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-13 16:04:33,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:04:33,755 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:04:33,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:04:33,977 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:04:33,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33 WrapperNode [2024-11-13 16:04:33,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:04:33,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:04:33,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:04:33,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:04:33,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,128 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-13 16:04:34,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:04:34,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:04:34,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:04:34,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:04:34,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,304 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2024-11-13 16:04:34,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:04:34,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:04:34,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:04:34,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:04:34,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (1/1) ... [2024-11-13 16:04:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:04:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:04:34,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:04:34,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:04:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 16:04:34,537 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 16:04:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:04:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:04:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:04:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 16:04:34,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 16:04:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:04:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:04:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:04:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 16:04:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 16:04:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 16:04:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 16:04:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 16:04:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 16:04:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 16:04:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 16:04:34,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 16:04:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:04:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:04:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:04:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:04:34,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:04:34,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:04:34,869 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:04:34,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:04:34,897 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 16:04:34,940 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 16:04:34,966 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 16:04:38,919 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-13 16:04:38,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:04:38,974 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:04:38,974 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-13 16:04:38,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:38 BoogieIcfgContainer [2024-11-13 16:04:38,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:04:38,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:04:38,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:04:38,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:04:38,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:04:32" (1/3) ... [2024-11-13 16:04:38,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170d49a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:04:38, skipping insertion in model container [2024-11-13 16:04:38,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:04:33" (2/3) ... [2024-11-13 16:04:38,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170d49a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:04:38, skipping insertion in model container [2024-11-13 16:04:38,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:04:38" (3/3) ... [2024-11-13 16:04:38,988 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2024-11-13 16:04:39,006 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:04:39,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test5-1.i that has 6 procedures, 1748 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2024-11-13 16:04:39,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:04:39,123 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;@40b6670d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:04:39,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-13 16:04:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 16:04:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:04:39,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:39,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:04:39,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:39,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-13 16:04:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309396469] [2024-11-13 16:04:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:39,342 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-13 16:04:39,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309396469] [2024-11-13 16:04:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309396469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951627221] [2024-11-13 16:04:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:39,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:04:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:39,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:04:39,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:04:39,387 INFO L87 Difference]: Start difference. First operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:39,501 INFO L93 Difference]: Finished difference Result 1718 states and 1978 transitions. [2024-11-13 16:04:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:04:39,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 16:04:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:39,533 INFO L225 Difference]: With dead ends: 1718 [2024-11-13 16:04:39,534 INFO L226 Difference]: Without dead ends: 1716 [2024-11-13 16:04:39,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:04:39,540 INFO L432 NwaCegarLoop]: 1978 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:39,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:04:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-13 16:04:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2024-11-13 16:04:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1005 states have (on average 1.9422885572139303) internal successors, (1952), 1706 states have internal predecessors, (1952), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1976 transitions. [2024-11-13 16:04:39,706 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1976 transitions. Word has length 5 [2024-11-13 16:04:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:39,706 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1976 transitions. [2024-11-13 16:04:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1976 transitions. [2024-11-13 16:04:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:04:39,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:39,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:04:39,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:04:39,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:39,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-13 16:04:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147660297] [2024-11-13 16:04:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:39,888 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-13 16:04:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147660297] [2024-11-13 16:04:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147660297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365867034] [2024-11-13 16:04:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:39,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:39,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:39,890 INFO L87 Difference]: Start difference. First operand 1716 states and 1976 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:41,715 INFO L93 Difference]: Finished difference Result 1945 states and 2293 transitions. [2024-11-13 16:04:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 16:04:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:41,729 INFO L225 Difference]: With dead ends: 1945 [2024-11-13 16:04:41,731 INFO L226 Difference]: Without dead ends: 1945 [2024-11-13 16:04:41,731 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-13 16:04:41,733 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1737 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:41,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1918 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 16:04:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-13 16:04:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1624. [2024-11-13 16:04:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1005 states have (on average 1.8507462686567164) internal successors, (1860), 1614 states have internal predecessors, (1860), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1884 transitions. [2024-11-13 16:04:41,839 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1884 transitions. Word has length 5 [2024-11-13 16:04:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:41,840 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1884 transitions. [2024-11-13 16:04:41,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1884 transitions. [2024-11-13 16:04:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:04:41,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:41,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:04:41,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:04:41,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:41,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-13 16:04:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:41,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716190038] [2024-11-13 16:04:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:42,041 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-13 16:04:42,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:42,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716190038] [2024-11-13 16:04:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716190038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:04:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747965430] [2024-11-13 16:04:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:42,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:42,043 INFO L87 Difference]: Start difference. First operand 1624 states and 1884 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:43,797 INFO L93 Difference]: Finished difference Result 2361 states and 2785 transitions. [2024-11-13 16:04:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 16:04:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:43,806 INFO L225 Difference]: With dead ends: 2361 [2024-11-13 16:04:43,806 INFO L226 Difference]: Without dead ends: 2361 [2024-11-13 16:04:43,806 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-13 16:04:43,807 INFO L432 NwaCegarLoop]: 1955 mSDtfsCounter, 1217 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:43,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2890 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 16:04:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-13 16:04:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1887. [2024-11-13 16:04:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1278 states have (on average 1.8262910798122065) internal successors, (2334), 1877 states have internal predecessors, (2334), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2358 transitions. [2024-11-13 16:04:43,858 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2358 transitions. Word has length 5 [2024-11-13 16:04:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:43,859 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2358 transitions. [2024-11-13 16:04:43,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2358 transitions. [2024-11-13 16:04:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 16:04:43,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:43,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 16:04:43,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:04:43,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:43,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1957032533, now seen corresponding path program 1 times [2024-11-13 16:04:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:43,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710273411] [2024-11-13 16:04:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:43,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-13 16:04:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710273411] [2024-11-13 16:04:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710273411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:43,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606449724] [2024-11-13 16:04:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:43,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:43,929 INFO L87 Difference]: Start difference. First operand 1887 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:44,016 INFO L93 Difference]: Finished difference Result 3755 states and 4697 transitions. [2024-11-13 16:04:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:44,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 16:04:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:44,030 INFO L225 Difference]: With dead ends: 3755 [2024-11-13 16:04:44,031 INFO L226 Difference]: Without dead ends: 3755 [2024-11-13 16:04:44,031 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-13 16:04:44,032 INFO L432 NwaCegarLoop]: 2150 mSDtfsCounter, 1830 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:44,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4014 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:04:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-13 16:04:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1889. [2024-11-13 16:04:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1280 states have (on average 1.825) internal successors, (2336), 1879 states have internal predecessors, (2336), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2360 transitions. [2024-11-13 16:04:44,128 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2360 transitions. Word has length 6 [2024-11-13 16:04:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:44,128 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2360 transitions. [2024-11-13 16:04:44,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2360 transitions. [2024-11-13 16:04:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 16:04:44,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:44,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:44,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:04:44,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:44,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash -408167591, now seen corresponding path program 1 times [2024-11-13 16:04:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040698418] [2024-11-13 16:04:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:44,280 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-13 16:04:44,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040698418] [2024-11-13 16:04:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040698418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:44,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302392897] [2024-11-13 16:04:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:44,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:44,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:44,284 INFO L87 Difference]: Start difference. First operand 1889 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:44,350 INFO L93 Difference]: Finished difference Result 1802 states and 2245 transitions. [2024-11-13 16:04:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 16:04:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:44,359 INFO L225 Difference]: With dead ends: 1802 [2024-11-13 16:04:44,360 INFO L226 Difference]: Without dead ends: 1802 [2024-11-13 16:04:44,360 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-13 16:04:44,365 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 71 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3431 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-13 16:04:44,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:04:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-13 16:04:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-13 16:04:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1217 states have (on average 1.8249794576828267) internal successors, (2221), 1792 states have internal predecessors, (2221), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2245 transitions. [2024-11-13 16:04:44,433 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2245 transitions. Word has length 11 [2024-11-13 16:04:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:44,434 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2245 transitions. [2024-11-13 16:04:44,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2245 transitions. [2024-11-13 16:04:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:04:44,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:44,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:04:44,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1406875437, now seen corresponding path program 1 times [2024-11-13 16:04:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140426199] [2024-11-13 16:04:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:44,620 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-13 16:04:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:44,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140426199] [2024-11-13 16:04:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140426199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:44,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:44,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:04:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036574080] [2024-11-13 16:04:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:44,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:04:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:44,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:04:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:04:44,623 INFO L87 Difference]: Start difference. First operand 1802 states and 2245 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:44,768 INFO L93 Difference]: Finished difference Result 1780 states and 2216 transitions. [2024-11-13 16:04:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:04:44,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 16:04:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:44,777 INFO L225 Difference]: With dead ends: 1780 [2024-11-13 16:04:44,777 INFO L226 Difference]: Without dead ends: 1780 [2024-11-13 16:04:44,777 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-13 16:04:44,779 INFO L432 NwaCegarLoop]: 1702 mSDtfsCounter, 48 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5080 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:44,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5080 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:04:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2024-11-13 16:04:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2024-11-13 16:04:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1209 states have (on average 1.8130686517783292) internal successors, (2192), 1770 states have internal predecessors, (2192), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2216 transitions. [2024-11-13 16:04:44,828 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2216 transitions. Word has length 13 [2024-11-13 16:04:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:44,828 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2216 transitions. [2024-11-13 16:04:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2216 transitions. [2024-11-13 16:04:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 16:04:44,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:44,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:44,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:04:44,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:44,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1422483263, now seen corresponding path program 1 times [2024-11-13 16:04:44,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509477193] [2024-11-13 16:04:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:44,958 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-13 16:04:44,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509477193] [2024-11-13 16:04:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509477193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316228378] [2024-11-13 16:04:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:44,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:04:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:04:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:04:44,959 INFO L87 Difference]: Start difference. First operand 1780 states and 2216 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:46,587 INFO L93 Difference]: Finished difference Result 1825 states and 2288 transitions. [2024-11-13 16:04:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:04:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 16:04:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:46,595 INFO L225 Difference]: With dead ends: 1825 [2024-11-13 16:04:46,596 INFO L226 Difference]: Without dead ends: 1825 [2024-11-13 16:04:46,596 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-13 16:04:46,598 INFO L432 NwaCegarLoop]: 1068 mSDtfsCounter, 1747 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:46,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 2084 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 16:04:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-13 16:04:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1776. [2024-11-13 16:04:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1209 states have (on average 1.8097601323407775) internal successors, (2188), 1766 states have internal predecessors, (2188), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2212 transitions. [2024-11-13 16:04:46,648 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2212 transitions. Word has length 27 [2024-11-13 16:04:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:46,649 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2212 transitions. [2024-11-13 16:04:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2212 transitions. [2024-11-13 16:04:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 16:04:46,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:46,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:04:46,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1422483262, now seen corresponding path program 1 times [2024-11-13 16:04:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143892292] [2024-11-13 16:04:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:46,968 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-13 16:04:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143892292] [2024-11-13 16:04:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143892292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087860368] [2024-11-13 16:04:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:46,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:04:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:46,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:04:46,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:04:46,970 INFO L87 Difference]: Start difference. First operand 1776 states and 2212 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:49,006 INFO L93 Difference]: Finished difference Result 2296 states and 2712 transitions. [2024-11-13 16:04:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:04:49,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 16:04:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:49,021 INFO L225 Difference]: With dead ends: 2296 [2024-11-13 16:04:49,021 INFO L226 Difference]: Without dead ends: 2296 [2024-11-13 16:04:49,021 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-13 16:04:49,022 INFO L432 NwaCegarLoop]: 1431 mSDtfsCounter, 1222 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:49,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3385 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 16:04:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-13 16:04:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1772. [2024-11-13 16:04:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1209 states have (on average 1.8064516129032258) internal successors, (2184), 1762 states have internal predecessors, (2184), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2208 transitions. [2024-11-13 16:04:49,076 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2208 transitions. Word has length 27 [2024-11-13 16:04:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2208 transitions. [2024-11-13 16:04:49,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2208 transitions. [2024-11-13 16:04:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 16:04:49,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:49,079 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] [2024-11-13 16:04:49,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:04:49,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:49,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -460247980, now seen corresponding path program 1 times [2024-11-13 16:04:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045692148] [2024-11-13 16:04:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:49,312 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-13 16:04:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045692148] [2024-11-13 16:04:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045692148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:04:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304665095] [2024-11-13 16:04:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:49,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:04:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:04:49,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:04:49,316 INFO L87 Difference]: Start difference. First operand 1772 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:49,402 INFO L93 Difference]: Finished difference Result 1766 states and 2198 transitions. [2024-11-13 16:04:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:04:49,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-13 16:04:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:49,409 INFO L225 Difference]: With dead ends: 1766 [2024-11-13 16:04:49,410 INFO L226 Difference]: Without dead ends: 1766 [2024-11-13 16:04:49,410 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-13 16:04:49,412 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 21 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5057 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-13 16:04:49,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:04:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-13 16:04:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-13 16:04:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1203 states have (on average 1.8071487946799667) internal successors, (2174), 1756 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2198 transitions. [2024-11-13 16:04:49,461 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2198 transitions. Word has length 61 [2024-11-13 16:04:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:49,461 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2198 transitions. [2024-11-13 16:04:49,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2198 transitions. [2024-11-13 16:04:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 16:04:49,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:49,463 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-13 16:04:49,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:04:49,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:49,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1135528096, now seen corresponding path program 1 times [2024-11-13 16:04:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:49,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463451917] [2024-11-13 16:04:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:49,711 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-13 16:04:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463451917] [2024-11-13 16:04:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463451917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:49,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:04:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210491775] [2024-11-13 16:04:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:49,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:04:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:04:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:04:49,715 INFO L87 Difference]: Start difference. First operand 1766 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-13 16:04:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:49,780 INFO L93 Difference]: Finished difference Result 1858 states and 2317 transitions. [2024-11-13 16:04:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:04:49,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-13 16:04:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:49,790 INFO L225 Difference]: With dead ends: 1858 [2024-11-13 16:04:49,790 INFO L226 Difference]: Without dead ends: 1858 [2024-11-13 16:04:49,790 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-13 16:04:49,791 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:49,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:04:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-13 16:04:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-13 16:04:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1295 states have (on average 1.7706563706563707) internal successors, (2293), 1848 states have internal predecessors, (2293), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2317 transitions. [2024-11-13 16:04:49,839 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2317 transitions. Word has length 69 [2024-11-13 16:04:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:49,841 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2317 transitions. [2024-11-13 16:04:49,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-13 16:04:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2317 transitions. [2024-11-13 16:04:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 16:04:49,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:49,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:04:49,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1247947441, now seen corresponding path program 1 times [2024-11-13 16:04:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:49,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244350575] [2024-11-13 16:04:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:50,826 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-13 16:04:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:50,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244350575] [2024-11-13 16:04:50,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244350575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:50,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:50,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:04:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183345700] [2024-11-13 16:04:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:50,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:04:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:04:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:50,830 INFO L87 Difference]: Start difference. First operand 1858 states and 2317 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:52,744 INFO L93 Difference]: Finished difference Result 1774 states and 2233 transitions. [2024-11-13 16:04:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:04:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-13 16:04:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:52,750 INFO L225 Difference]: With dead ends: 1774 [2024-11-13 16:04:52,751 INFO L226 Difference]: Without dead ends: 1774 [2024-11-13 16:04:52,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:04:52,751 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 3064 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3075 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:52,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3075 Valid, 1598 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 16:04:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-13 16:04:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1501. [2024-11-13 16:04:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-13 16:04:52,781 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 72 [2024-11-13 16:04:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:52,781 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-13 16:04:52,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-13 16:04:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 16:04:52,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:52,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:04:52,783 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:52,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash -588442893, now seen corresponding path program 1 times [2024-11-13 16:04:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884450172] [2024-11-13 16:04:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:53,181 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-13 16:04:53,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884450172] [2024-11-13 16:04:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884450172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:53,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:53,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:04:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907692622] [2024-11-13 16:04:53,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:53,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:04:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:04:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:04:53,182 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:54,721 INFO L93 Difference]: Finished difference Result 1500 states and 1748 transitions. [2024-11-13 16:04:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:04:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-13 16:04:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:54,727 INFO L225 Difference]: With dead ends: 1500 [2024-11-13 16:04:54,727 INFO L226 Difference]: Without dead ends: 1500 [2024-11-13 16:04:54,727 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-13 16:04:54,728 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:54,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4778 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 16:04:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-13 16:04:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2024-11-13 16:04:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1022 states have (on average 1.6868884540117417) internal successors, (1724), 1490 states have internal predecessors, (1724), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-13 16:04:54,756 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 77 [2024-11-13 16:04:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:54,756 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-13 16:04:54,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-13 16:04:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 16:04:54,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:54,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:04:54,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:04:54,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:54,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash -588442892, now seen corresponding path program 1 times [2024-11-13 16:04:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:54,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716217319] [2024-11-13 16:04:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:54,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:55,396 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-13 16:04:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:55,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716217319] [2024-11-13 16:04:55,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716217319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:04:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893411713] [2024-11-13 16:04:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:55,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:04:55,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:55,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:04:55,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:04:55,398 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:57,204 INFO L93 Difference]: Finished difference Result 1499 states and 1747 transitions. [2024-11-13 16:04:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:04:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-13 16:04:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:57,210 INFO L225 Difference]: With dead ends: 1499 [2024-11-13 16:04:57,211 INFO L226 Difference]: Without dead ends: 1499 [2024-11-13 16:04:57,211 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-13 16:04:57,212 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 1 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:57,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4800 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 16:04:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-13 16:04:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-11-13 16:04:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1021 states have (on average 1.6875612144955925) internal successors, (1723), 1489 states have internal predecessors, (1723), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:04:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1747 transitions. [2024-11-13 16:04:57,247 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1747 transitions. Word has length 77 [2024-11-13 16:04:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:57,248 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1747 transitions. [2024-11-13 16:04:57,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:04:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1747 transitions. [2024-11-13 16:04:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 16:04:57,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:57,250 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-13 16:04:57,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:04:57,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:57,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1920377754, now seen corresponding path program 1 times [2024-11-13 16:04:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940955076] [2024-11-13 16:04:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:04:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:04:57,634 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-13 16:04:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:04:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940955076] [2024-11-13 16:04:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940955076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:04:57,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:04:57,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:04:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241506186] [2024-11-13 16:04:57,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:04:57,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:04:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:04:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:04:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:04:57,637 INFO L87 Difference]: Start difference. First operand 1499 states and 1747 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 16:04:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:59,904 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-13 16:04:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:04:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-13 16:04:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:59,910 INFO L225 Difference]: With dead ends: 1511 [2024-11-13 16:04:59,910 INFO L226 Difference]: Without dead ends: 1511 [2024-11-13 16:04:59,911 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-13 16:04:59,911 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 17 mSDsluCounter, 5773 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7378 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:59,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7378 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 16:04:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-13 16:04:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1505. [2024-11-13 16:04:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6861598440545809) internal successors, (1730), 1494 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-13 16:04:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1760 transitions. [2024-11-13 16:04:59,949 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1760 transitions. Word has length 85 [2024-11-13 16:04:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:59,953 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1760 transitions. [2024-11-13 16:04:59,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-13 16:04:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1760 transitions. [2024-11-13 16:04:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 16:04:59,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:59,958 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-13 16:04:59,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:04:59,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:04:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1920377755, now seen corresponding path program 1 times [2024-11-13 16:04:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274054556] [2024-11-13 16:04:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:00,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-13 16:05:00,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:00,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274054556] [2024-11-13 16:05:00,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274054556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:00,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:00,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:05:00,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647289224] [2024-11-13 16:05:00,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:00,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:05:00,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:05:00,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:05:00,704 INFO L87 Difference]: Start difference. First operand 1505 states and 1760 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 16:05:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:03,028 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2024-11-13 16:05:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:05:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-13 16:05:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:03,034 INFO L225 Difference]: With dead ends: 1505 [2024-11-13 16:05:03,034 INFO L226 Difference]: Without dead ends: 1505 [2024-11-13 16:05:03,034 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-13 16:05:03,035 INFO L432 NwaCegarLoop]: 1612 mSDtfsCounter, 12 mSDsluCounter, 5819 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7431 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:03,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7431 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 16:05:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-11-13 16:05:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-11-13 16:05:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6851851851851851) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-13 16:05:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1759 transitions. [2024-11-13 16:05:03,063 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1759 transitions. Word has length 85 [2024-11-13 16:05:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1759 transitions. [2024-11-13 16:05:03,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-13 16:05:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2024-11-13 16:05:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 16:05:03,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:03,065 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] [2024-11-13 16:05:03,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:05:03,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:03,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1043625902, now seen corresponding path program 1 times [2024-11-13 16:05:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:03,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949781252] [2024-11-13 16:05:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:03,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:03,730 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-13 16:05:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949781252] [2024-11-13 16:05:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949781252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767508168] [2024-11-13 16:05:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:03,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:03,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:05:03,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:05:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:04,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 16:05:04,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:05:04,279 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:05:04,280 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-13 16:05:04,338 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-13 16:05:04,457 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-13 16:05:04,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:04,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:04,759 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-13 16:05:04,808 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-13 16:05:04,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:05:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767508168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:04,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:05:04,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-13 16:05:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218045528] [2024-11-13 16:05:04,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:05:04,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:05:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:05:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=314, Unknown=12, NotChecked=0, Total=380 [2024-11-13 16:05:04,905 INFO L87 Difference]: Start difference. First operand 1505 states and 1759 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-13 16:05:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:10,266 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-13 16:05:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:05:10,267 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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 86 [2024-11-13 16:05:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:10,270 INFO L225 Difference]: With dead ends: 1512 [2024-11-13 16:05:10,271 INFO L226 Difference]: Without dead ends: 1512 [2024-11-13 16:05:10,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=500, Unknown=13, NotChecked=0, Total=600 [2024-11-13 16:05:10,271 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1571 mSDsluCounter, 12219 mSDsCounter, 0 mSdLazyCounter, 7759 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 13263 SdHoareTripleChecker+Invalid, 7788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:10,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 13263 Invalid, 7788 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7759 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 16:05:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-13 16:05:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2024-11-13 16:05:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1030 states have (on average 1.6825242718446602) internal successors, (1733), 1497 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:05:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2024-11-13 16:05:10,295 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 86 [2024-11-13 16:05:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:10,295 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2024-11-13 16:05:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-13 16:05:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2024-11-13 16:05:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 16:05:10,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:10,296 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] [2024-11-13 16:05:10,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:05:10,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 16:05:10,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1043625901, now seen corresponding path program 1 times [2024-11-13 16:05:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:10,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346815448] [2024-11-13 16:05:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:11,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:11,550 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-13 16:05:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346815448] [2024-11-13 16:05:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346815448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10183918] [2024-11-13 16:05:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:11,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:11,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:05:11,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:05:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:11,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 16:05:11,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:05:12,022 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-13 16:05:12,038 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:05:12,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:05:12,056 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-13 16:05:12,066 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-13 16:05:12,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 16:05:12,175 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-13 16:05:12,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:12,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:12,331 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-13 16:05:12,368 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-13 16:05:12,376 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-13 16:05:12,378 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-13 16:05:12,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:05:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10183918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:12,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:05:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-13 16:05:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045056941] [2024-11-13 16:05:12,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:05:12,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 16:05:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 16:05:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=279, Unknown=7, NotChecked=0, Total=342 [2024-11-13 16:05:12,611 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 16 states, 13 states have (on average 8.076923076923077) internal successors, (105), 15 states have internal predecessors, (105), 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-13 16:05:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:18,215 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-13 16:05:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:05:18,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.076923076923077) internal successors, (105), 15 states have internal predecessors, (105), 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 86 [2024-11-13 16:05:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:18,220 INFO L225 Difference]: With dead ends: 1511 [2024-11-13 16:05:18,220 INFO L226 Difference]: Without dead ends: 1511 [2024-11-13 16:05:18,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=452, Unknown=8, NotChecked=0, Total=552 [2024-11-13 16:05:18,221 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1562 mSDsluCounter, 6836 mSDsCounter, 0 mSdLazyCounter, 6705 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 7886 SdHoareTripleChecker+Invalid, 6756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 6705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 7886 Invalid, 6756 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 6705 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-13 16:05:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-13 16:05:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1502. [2024-11-13 16:05:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:05:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-13 16:05:18,243 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 86 [2024-11-13 16:05:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:18,243 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-13 16:05:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.076923076923077) internal successors, (105), 15 states have internal predecessors, (105), 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-13 16:05:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-13 16:05:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 16:05:18,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:18,244 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] [2024-11-13 16:05:18,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 16:05:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:18,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:18,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1009905368, now seen corresponding path program 1 times [2024-11-13 16:05:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000590967] [2024-11-13 16:05:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:19,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:19,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000590967] [2024-11-13 16:05:19,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000590967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:19,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:19,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 16:05:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903936263] [2024-11-13 16:05:19,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:19,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:05:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:05:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:05:19,167 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-13 16:05:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:22,827 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-13 16:05:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:05:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-13 16:05:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:22,830 INFO L225 Difference]: With dead ends: 1515 [2024-11-13 16:05:22,830 INFO L226 Difference]: Without dead ends: 1515 [2024-11-13 16:05:22,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 16:05:22,831 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1573 mSDsluCounter, 9169 mSDsCounter, 0 mSdLazyCounter, 5953 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 10213 SdHoareTripleChecker+Invalid, 5979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:22,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 10213 Invalid, 5979 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 5953 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 16:05:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-13 16:05:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1511. [2024-11-13 16:05:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6805421103581801) internal successors, (1736), 1499 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:05:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1761 transitions. [2024-11-13 16:05:22,858 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1761 transitions. Word has length 88 [2024-11-13 16:05:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:22,859 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1761 transitions. [2024-11-13 16:05:22,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-13 16:05:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1761 transitions. [2024-11-13 16:05:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 16:05:22,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:22,860 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] [2024-11-13 16:05:22,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 16:05:22,860 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1009905369, now seen corresponding path program 1 times [2024-11-13 16:05:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546159767] [2024-11-13 16:05:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:23,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546159767] [2024-11-13 16:05:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546159767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:23,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:23,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:05:23,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831691894] [2024-11-13 16:05:23,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:23,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:05:23,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:05:23,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:05:23,772 INFO L87 Difference]: Start difference. First operand 1511 states and 1761 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-13 16:05:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:27,212 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-13 16:05:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:05:27,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-13 16:05:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:27,217 INFO L225 Difference]: With dead ends: 1514 [2024-11-13 16:05:27,217 INFO L226 Difference]: Without dead ends: 1514 [2024-11-13 16:05:27,218 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-13 16:05:27,218 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1548 mSDsluCounter, 5473 mSDsCounter, 0 mSdLazyCounter, 4815 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 6524 SdHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:27,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 6524 Invalid, 4839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4815 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-13 16:05:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-13 16:05:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-13 16:05:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6795740561471442) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:05:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-13 16:05:27,252 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 88 [2024-11-13 16:05:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:27,252 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-13 16:05:27,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-13 16:05:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-13 16:05:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 16:05:27,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:27,253 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] [2024-11-13 16:05:27,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 16:05:27,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:27,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash 609627936, now seen corresponding path program 1 times [2024-11-13 16:05:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363973297] [2024-11-13 16:05:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:27,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:27,971 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-13 16:05:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363973297] [2024-11-13 16:05:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363973297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050499988] [2024-11-13 16:05:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:27,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:27,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:05:27,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:05:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:28,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 16:05:28,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:05:28,332 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-13 16:05:28,495 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:05:28,496 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-13 16:05:28,542 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-13 16:05:28,671 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-13 16:05:28,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:28,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 42 treesize of output 41 [2024-11-13 16:05:29,024 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:29,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:29,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:05:29,095 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-13 16:05:29,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:05:29,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_943) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 16:05:29,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 16:05:29,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_943 (Array Int Int)) (v_ArrVal_946 (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$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_946))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_943)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:05:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050499988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:29,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:05:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-13 16:05:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715256386] [2024-11-13 16:05:29,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:05:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 16:05:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 16:05:29,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2024-11-13 16:05:29,151 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 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-13 16:05:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:34,796 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-13 16:05:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:05:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 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 89 [2024-11-13 16:05:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:34,800 INFO L225 Difference]: With dead ends: 1513 [2024-11-13 16:05:34,800 INFO L226 Difference]: Without dead ends: 1513 [2024-11-13 16:05:34,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=558, Unknown=3, NotChecked=150, Total=812 [2024-11-13 16:05:34,801 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1537 mSDsluCounter, 12228 mSDsCounter, 0 mSdLazyCounter, 7778 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 13271 SdHoareTripleChecker+Invalid, 7804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:34,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 13271 Invalid, 7804 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 7778 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-13 16:05:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-13 16:05:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-13 16:05:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1033 states have (on average 1.6786060019361084) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:05:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1759 transitions. [2024-11-13 16:05:34,829 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1759 transitions. Word has length 89 [2024-11-13 16:05:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:34,831 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1759 transitions. [2024-11-13 16:05:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.421052631578948) internal successors, (141), 21 states have internal predecessors, (141), 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-13 16:05:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1759 transitions. [2024-11-13 16:05:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 16:05:34,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:34,833 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] [2024-11-13 16:05:34,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 16:05:35,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:35,038 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash 609627937, now seen corresponding path program 1 times [2024-11-13 16:05:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756288157] [2024-11-13 16:05:35,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:36,010 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-13 16:05:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756288157] [2024-11-13 16:05:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756288157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649817569] [2024-11-13 16:05:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:36,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:36,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:36,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:05:36,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:05:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:36,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 16:05:36,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:05:36,363 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-13 16:05:36,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 16:05:36,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:05:36,535 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-13 16:05:36,578 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-13 16:05:36,582 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-13 16:05:36,700 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-13 16:05:36,705 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-13 16:05:36,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:36,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:36,853 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-13 16:05:36,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:36,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:36,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:05:36,988 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-13 16:05:36,994 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-13 16:05:37,037 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-13 16:05:37,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:05:37,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1092 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 16:05:37,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1098) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1099))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1098) .cse1 v_ArrVal_1092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 16:05:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649817569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:37,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:05:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-13 16:05:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025474704] [2024-11-13 16:05:37,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:05:37,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 16:05:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:37,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 16:05:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=471, Unknown=6, NotChecked=90, Total=650 [2024-11-13 16:05:37,276 INFO L87 Difference]: Start difference. First operand 1510 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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-13 16:05:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:44,165 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-13 16:05:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:05:44,166 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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 89 [2024-11-13 16:05:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:44,169 INFO L225 Difference]: With dead ends: 1512 [2024-11-13 16:05:44,169 INFO L226 Difference]: Without dead ends: 1512 [2024-11-13 16:05:44,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=735, Unknown=6, NotChecked=114, Total=992 [2024-11-13 16:05:44,170 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1541 mSDsluCounter, 11299 mSDsCounter, 0 mSdLazyCounter, 10312 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 12348 SdHoareTripleChecker+Invalid, 10340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 10312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:44,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 12348 Invalid, 10340 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 10312 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-13 16:05:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-13 16:05:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1500. [2024-11-13 16:05:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:05:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-13 16:05:44,190 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 89 [2024-11-13 16:05:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-13 16:05:44,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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-13 16:05:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-13 16:05:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 16:05:44,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:44,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:44,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 16:05:44,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:44,396 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:44,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -154464767, now seen corresponding path program 1 times [2024-11-13 16:05:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458634410] [2024-11-13 16:05:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:45,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:45,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458634410] [2024-11-13 16:05:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458634410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:45,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:45,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 16:05:45,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651371813] [2024-11-13 16:05:45,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:45,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 16:05:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:45,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 16:05:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:05:45,081 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-13 16:05:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:49,770 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-13 16:05:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:05:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-13 16:05:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:49,781 INFO L225 Difference]: With dead ends: 1516 [2024-11-13 16:05:49,781 INFO L226 Difference]: Without dead ends: 1516 [2024-11-13 16:05:49,782 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-13 16:05:49,784 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1568 mSDsluCounter, 12209 mSDsCounter, 0 mSdLazyCounter, 7757 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 13252 SdHoareTripleChecker+Invalid, 7782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:49,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 13252 Invalid, 7782 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7757 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-13 16:05:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-13 16:05:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2024-11-13 16:05:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6766409266409266) internal successors, (1737), 1500 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:05:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1762 transitions. [2024-11-13 16:05:49,807 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1762 transitions. Word has length 91 [2024-11-13 16:05:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:49,808 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1762 transitions. [2024-11-13 16:05:49,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-13 16:05:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1762 transitions. [2024-11-13 16:05:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 16:05:49,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:49,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:49,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 16:05:49,811 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:49,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash -154464766, now seen corresponding path program 1 times [2024-11-13 16:05:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432087642] [2024-11-13 16:05:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:50,809 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-13 16:05:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432087642] [2024-11-13 16:05:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432087642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:50,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 16:05:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159828595] [2024-11-13 16:05:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:50,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:05:50,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:05:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:05:50,811 INFO L87 Difference]: Start difference. First operand 1512 states and 1762 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-13 16:05:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:54,826 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-13 16:05:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:05:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-13 16:05:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:05:54,830 INFO L225 Difference]: With dead ends: 1515 [2024-11-13 16:05:54,830 INFO L226 Difference]: Without dead ends: 1515 [2024-11-13 16:05:54,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:05:54,831 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1549 mSDsluCounter, 6272 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:05:54,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 7322 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-13 16:05:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-13 16:05:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-13 16:05:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6756756756756757) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:05:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-13 16:05:54,852 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 91 [2024-11-13 16:05:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:05:54,852 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-13 16:05:54,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-13 16:05:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-13 16:05:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 16:05:54,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:05:54,854 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] [2024-11-13 16:05:54,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 16:05:54,854 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:05:54,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1990227783, now seen corresponding path program 1 times [2024-11-13 16:05:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:54,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367901730] [2024-11-13 16:05:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:55,576 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-13 16:05:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367901730] [2024-11-13 16:05:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367901730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303614321] [2024-11-13 16:05:55,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:05:55,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:55,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:05:55,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:05:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:55,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 16:05:55,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:05:55,961 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-13 16:05:56,123 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:05:56,123 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-13 16:05:56,168 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-13 16:05:56,274 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-13 16:05:56,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:56,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:56,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:56,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:05:56,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:05:56,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:05:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:05:56,718 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-13 16:05:56,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:05:56,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (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$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:05:56,858 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:05:56,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (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$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1390))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1386)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:05:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303614321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:05:56,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:05:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-13 16:05:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399112551] [2024-11-13 16:05:56,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:05:56,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 16:05:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 16:05:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=541, Unknown=20, NotChecked=150, Total=812 [2024-11-13 16:05:56,893 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 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-13 16:06:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:02,468 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-13 16:06:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:06:02,468 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 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 92 [2024-11-13 16:06:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:02,472 INFO L225 Difference]: With dead ends: 1514 [2024-11-13 16:06:02,472 INFO L226 Difference]: Without dead ends: 1514 [2024-11-13 16:06:02,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=630, Unknown=20, NotChecked=162, Total=930 [2024-11-13 16:06:02,473 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1536 mSDsluCounter, 13250 mSDsCounter, 0 mSdLazyCounter, 8329 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 14298 SdHoareTripleChecker+Invalid, 8366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 8329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:02,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 14298 Invalid, 8366 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 8329 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-13 16:06:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-13 16:06:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-13 16:06:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1036 states have (on average 1.6747104247104247) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:06:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-13 16:06:02,494 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 92 [2024-11-13 16:06:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:02,495 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-13 16:06:02,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 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-13 16:06:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-13 16:06:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 16:06:02,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:02,500 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] [2024-11-13 16:06:02,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 16:06:02,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:02,701 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1990227782, now seen corresponding path program 1 times [2024-11-13 16:06:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119978052] [2024-11-13 16:06:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:03,803 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-13 16:06:03,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:03,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119978052] [2024-11-13 16:06:03,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119978052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:03,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342932294] [2024-11-13 16:06:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:03,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:03,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:03,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:06:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:04,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 16:06:04,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:04,165 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-13 16:06:04,299 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:06:04,299 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-13 16:06:04,307 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-13 16:06:04,316 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-13 16:06:04,327 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-13 16:06:04,394 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-13 16:06:04,399 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-13 16:06:04,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:04,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:04,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:06:04,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:04,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:06:04,649 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-13 16:06:04,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:04,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 62 treesize of output 57 [2024-11-13 16:06:04,721 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-13 16:06:04,742 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-13 16:06:04,746 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-13 16:06:04,749 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-13 16:06:04,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:06:04,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1551 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 16:06:04,848 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 16:06:04,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1549))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1548) .cse0 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1548) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-13 16:06:05,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1556))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1557) .cse0 v_ArrVal_1548) (select (select (store .cse1 .cse0 v_ArrVal_1549) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1551))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1556))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1549))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1548) .cse4 v_ArrVal_1551) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 16:06:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342932294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:05,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:06:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-13 16:06:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389811630] [2024-11-13 16:06:05,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:06:05,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:06:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:06:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=393, Unknown=7, NotChecked=172, Total=650 [2024-11-13 16:06:05,084 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 16:06:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:12,252 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-13 16:06:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:06:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-13 16:06:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:12,257 INFO L225 Difference]: With dead ends: 1513 [2024-11-13 16:06:12,257 INFO L226 Difference]: Without dead ends: 1513 [2024-11-13 16:06:12,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=793, Unknown=7, NotChecked=244, Total=1190 [2024-11-13 16:06:12,258 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1540 mSDsluCounter, 9387 mSDsCounter, 0 mSdLazyCounter, 8979 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 10428 SdHoareTripleChecker+Invalid, 9008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:12,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 10428 Invalid, 9008 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 8979 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-13 16:06:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-13 16:06:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-13 16:06:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:06:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-13 16:06:12,280 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 92 [2024-11-13 16:06:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:12,280 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-13 16:06:12,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 16:06:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-13 16:06:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 16:06:12,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:12,282 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-13 16:06:12,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:06:12,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:12,487 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1749267105, now seen corresponding path program 1 times [2024-11-13 16:06:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333917545] [2024-11-13 16:06:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:13,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:13,193 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-13 16:06:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333917545] [2024-11-13 16:06:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333917545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 16:06:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709976062] [2024-11-13 16:06:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:13,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 16:06:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 16:06:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:06:13,195 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-13 16:06:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:17,533 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-13 16:06:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:06:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2024-11-13 16:06:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:17,538 INFO L225 Difference]: With dead ends: 1517 [2024-11-13 16:06:17,538 INFO L226 Difference]: Without dead ends: 1517 [2024-11-13 16:06:17,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-13 16:06:17,539 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1551 mSDsluCounter, 11190 mSDsCounter, 0 mSdLazyCounter, 7186 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 12232 SdHoareTripleChecker+Invalid, 7211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:17,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 12232 Invalid, 7211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7186 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-13 16:06:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-13 16:06:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-13 16:06:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.672762271414822) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:06:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-13 16:06:17,562 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 94 [2024-11-13 16:06:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:17,562 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-13 16:06:17,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-13 16:06:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-13 16:06:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 16:06:17,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:17,563 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-13 16:06:17,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 16:06:17,563 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:17,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1749267104, now seen corresponding path program 1 times [2024-11-13 16:06:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851626938] [2024-11-13 16:06:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:18,420 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-13 16:06:18,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851626938] [2024-11-13 16:06:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851626938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:18,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 16:06:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061366538] [2024-11-13 16:06:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:06:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:06:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:06:18,422 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-13 16:06:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:23,341 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-13 16:06:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:06:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2024-11-13 16:06:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:23,344 INFO L225 Difference]: With dead ends: 1516 [2024-11-13 16:06:23,344 INFO L226 Difference]: Without dead ends: 1516 [2024-11-13 16:06:23,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:06:23,345 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1555 mSDsluCounter, 7839 mSDsCounter, 0 mSdLazyCounter, 7278 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 8888 SdHoareTripleChecker+Invalid, 7314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 7278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:23,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 8888 Invalid, 7314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 7278 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-13 16:06:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-13 16:06:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-13 16:06:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.6717998075072185) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:06:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-13 16:06:23,367 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 94 [2024-11-13 16:06:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:23,368 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-13 16:06:23,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-13 16:06:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-13 16:06:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 16:06:23,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:23,369 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] [2024-11-13 16:06:23,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 16:06:23,369 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1148270503, now seen corresponding path program 1 times [2024-11-13 16:06:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958971543] [2024-11-13 16:06:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:24,256 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-13 16:06:24,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958971543] [2024-11-13 16:06:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958971543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108627330] [2024-11-13 16:06:24,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:24,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:24,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:24,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:24,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:06:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:24,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 16:06:24,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:24,634 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-13 16:06:24,752 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:06:24,752 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-13 16:06:24,787 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-13 16:06:24,872 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-13 16:06:25,028 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:25,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:25,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:25,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-13 16:06:25,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:25,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:25,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:25,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:06:25,370 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-13 16:06:25,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:06:25,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1870 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 16:06:25,459 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (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$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:25,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:25,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (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$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1868))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:25,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (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$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1873))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1868)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108627330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:25,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:06:25,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-13 16:06:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690110997] [2024-11-13 16:06:25,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:06:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 16:06:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 16:06:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=20, NotChecked=280, Total=1056 [2024-11-13 16:06:25,585 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 states have internal predecessors, (153), 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-13 16:06:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:30,391 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-13 16:06:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:06:30,391 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 states have internal predecessors, (153), 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 95 [2024-11-13 16:06:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:30,394 INFO L225 Difference]: With dead ends: 1515 [2024-11-13 16:06:30,394 INFO L226 Difference]: Without dead ends: 1515 [2024-11-13 16:06:30,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=20, NotChecked=300, Total=1190 [2024-11-13 16:06:30,395 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 1541 mSDsluCounter, 9189 mSDsCounter, 0 mSdLazyCounter, 6006 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 10236 SdHoareTripleChecker+Invalid, 6053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:30,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 10236 Invalid, 6053 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 6006 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-13 16:06:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-13 16:06:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-13 16:06:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1039 states have (on average 1.670837343599615) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:06:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-13 16:06:30,413 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 95 [2024-11-13 16:06:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:30,413 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-13 16:06:30,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 states have internal predecessors, (153), 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-13 16:06:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-13 16:06:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 16:06:30,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:30,414 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] [2024-11-13 16:06:30,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 16:06:30,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:30,615 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:30,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1148270504, now seen corresponding path program 1 times [2024-11-13 16:06:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092267273] [2024-11-13 16:06:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:31,726 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-13 16:06:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092267273] [2024-11-13 16:06:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092267273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234008550] [2024-11-13 16:06:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:31,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:31,729 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:31,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 16:06:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:32,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 16:06:32,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:32,120 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-13 16:06:32,229 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-13 16:06:32,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:06:32,239 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-13 16:06:32,279 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-13 16:06:32,284 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-13 16:06:32,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 16:06:32,394 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-13 16:06:32,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:32,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:32,554 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-13 16:06:32,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:06:32,683 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-13 16:06:32,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:32,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:32,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-13 16:06:32,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:32,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:32,942 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-13 16:06:32,971 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-13 16:06:32,980 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-13 16:06:33,019 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-13 16:06:33,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:06:33,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2048 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-13 16:06:33,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2045) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2046))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2045) .cse1 v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 16:06:33,217 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2045) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2046))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2045) .cse2 v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-13 16:06:33,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2053 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2053))) (or (< (+ 16 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2044 (Array Int Int)) (v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2043 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2054))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse5 .cse2 v_ArrVal_2044))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store .cse0 .cse2 v_ArrVal_2043) .cse3 v_ArrVal_2045) (select (select (store .cse4 .cse3 v_ArrVal_2046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2048))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) (forall ((v_ArrVal_2053 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2053))) (or (< (+ 16 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2044 (Array Int Int)) (v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2043 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2054))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2044))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2046))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store (store .cse6 .cse7 v_ArrVal_2043) .cse8 v_ArrVal_2045) .cse9 v_ArrVal_2048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_2047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-13 16:06:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234008550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:33,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:06:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-13 16:06:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532924707] [2024-11-13 16:06:33,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:06:33,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 16:06:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 16:06:33,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=801, Unknown=13, NotChecked=244, Total=1190 [2024-11-13 16:06:33,623 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 states have internal predecessors, (153), 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-13 16:06:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:42,533 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-13 16:06:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:06:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 states have internal predecessors, (153), 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 95 [2024-11-13 16:06:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:42,535 INFO L225 Difference]: With dead ends: 1514 [2024-11-13 16:06:42,535 INFO L226 Difference]: Without dead ends: 1514 [2024-11-13 16:06:42,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=1264, Unknown=13, NotChecked=308, Total=1806 [2024-11-13 16:06:42,536 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 1536 mSDsluCounter, 13868 mSDsCounter, 0 mSdLazyCounter, 12501 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 14915 SdHoareTripleChecker+Invalid, 12528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 12501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:42,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 14915 Invalid, 12528 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 12501 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-13 16:06:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-13 16:06:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1496. [2024-11-13 16:06:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1025 states have (on average 1.6780487804878048) internal successors, (1720), 1485 states have internal predecessors, (1720), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:06:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1744 transitions. [2024-11-13 16:06:42,555 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1744 transitions. Word has length 95 [2024-11-13 16:06:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:42,555 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1744 transitions. [2024-11-13 16:06:42,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.6521739130434785) internal successors, (153), 25 states have internal predecessors, (153), 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-13 16:06:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1744 transitions. [2024-11-13 16:06:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 16:06:42,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:42,557 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] [2024-11-13 16:06:42,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 16:06:42,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 16:06:42,758 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:42,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1657337055, now seen corresponding path program 1 times [2024-11-13 16:06:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824916459] [2024-11-13 16:06:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:43,677 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-13 16:06:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824916459] [2024-11-13 16:06:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824916459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:43,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:43,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 16:06:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535606148] [2024-11-13 16:06:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:43,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 16:06:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 16:06:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:06:43,680 INFO L87 Difference]: Start difference. First operand 1496 states and 1744 transitions. Second operand has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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-13 16:06:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:47,123 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-13 16:06:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:06:47,124 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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 98 [2024-11-13 16:06:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:47,126 INFO L225 Difference]: With dead ends: 1519 [2024-11-13 16:06:47,126 INFO L226 Difference]: Without dead ends: 1519 [2024-11-13 16:06:47,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-13 16:06:47,127 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1570 mSDsluCounter, 9175 mSDsCounter, 0 mSdLazyCounter, 6015 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 10216 SdHoareTripleChecker+Invalid, 6042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 6015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:47,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 10216 Invalid, 6042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 6015 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 16:06:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-13 16:06:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2024-11-13 16:06:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1043 states have (on average 1.6682646212847556) internal successors, (1740), 1503 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:06:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1765 transitions. [2024-11-13 16:06:47,141 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1765 transitions. Word has length 98 [2024-11-13 16:06:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:47,141 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1765 transitions. [2024-11-13 16:06:47,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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-13 16:06:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1765 transitions. [2024-11-13 16:06:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-13 16:06:47,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:47,142 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] [2024-11-13 16:06:47,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 16:06:47,142 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1657337054, now seen corresponding path program 1 times [2024-11-13 16:06:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078233885] [2024-11-13 16:06:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:48,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:06:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078233885] [2024-11-13 16:06:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078233885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:06:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:06:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 16:06:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876415745] [2024-11-13 16:06:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:06:48,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 16:06:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 16:06:48,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:06:48,588 INFO L87 Difference]: Start difference. First operand 1515 states and 1765 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-13 16:06:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:55,515 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-13 16:06:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:06:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 98 [2024-11-13 16:06:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:55,517 INFO L225 Difference]: With dead ends: 1518 [2024-11-13 16:06:55,517 INFO L226 Difference]: Without dead ends: 1518 [2024-11-13 16:06:55,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 16:06:55,518 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1550 mSDsluCounter, 10943 mSDsCounter, 0 mSdLazyCounter, 10654 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 11984 SdHoareTripleChecker+Invalid, 10682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 10654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:55,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 11984 Invalid, 10682 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 10654 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-13 16:06:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-13 16:06:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2024-11-13 16:06:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1043 states have (on average 1.6673058485139023) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:06:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1764 transitions. [2024-11-13 16:06:55,534 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1764 transitions. Word has length 98 [2024-11-13 16:06:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1764 transitions. [2024-11-13 16:06:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-13 16:06:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1764 transitions. [2024-11-13 16:06:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:06:55,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:55,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:06:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 16:06:55,536 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:06:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1252159127, now seen corresponding path program 1 times [2024-11-13 16:06:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:55,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394972566] [2024-11-13 16:06:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:06:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:56,400 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-13 16:06:56,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:06:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394972566] [2024-11-13 16:06:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394972566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248119338] [2024-11-13 16:06:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:56,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:06:56,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:06:56,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 16:06:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:06:56,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 16:06:56,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:06:56,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 16:06:56,927 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:06:56,928 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-13 16:06:56,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:06:57,061 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-13 16:06:57,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:57,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:57,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:57,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:57,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:57,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:57,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:57,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:06:57,486 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:06:57,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:06:57,501 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-13 16:06:57,556 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-13 16:06:57,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-13 16:06:57,593 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-13 16:06:57,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:06:57,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 16:06:57,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2399))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:57,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2398 (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$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2398))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2399)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:57,782 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2397 (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$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2397))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2398)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2399)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:57,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2397 (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 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2404))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2397)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2398)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2399)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2400)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 16:06:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248119338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:06:57,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:06:57,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-13 16:06:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937454845] [2024-11-13 16:06:57,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:06:57,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 16:06:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:06:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 16:06:57,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=816, Unknown=32, NotChecked=320, Total=1332 [2024-11-13 16:06:57,892 INFO L87 Difference]: Start difference. First operand 1515 states and 1764 transitions. Second operand has 28 states, 25 states have (on average 6.44) internal successors, (161), 27 states have internal predecessors, (161), 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-13 16:07:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:07:03,769 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-13 16:07:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:07:03,769 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.44) internal successors, (161), 27 states have internal predecessors, (161), 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 99 [2024-11-13 16:07:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:07:03,772 INFO L225 Difference]: With dead ends: 1517 [2024-11-13 16:07:03,772 INFO L226 Difference]: Without dead ends: 1517 [2024-11-13 16:07:03,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=926, Unknown=32, NotChecked=340, Total=1482 [2024-11-13 16:07:03,773 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 1516 mSDsluCounter, 14252 mSDsCounter, 0 mSdLazyCounter, 8934 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 15298 SdHoareTripleChecker+Invalid, 8960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:07:03,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 15298 Invalid, 8960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 8934 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-13 16:07:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-13 16:07:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-13 16:07:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1043 states have (on average 1.666347075743049) internal successors, (1738), 1502 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:07:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-13 16:07:03,800 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 99 [2024-11-13 16:07:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:07:03,800 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-13 16:07:03,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.44) internal successors, (161), 27 states have internal predecessors, (161), 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-13 16:07:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-13 16:07:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 16:07:03,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:03,803 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-13 16:07:03,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 16:07:04,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-13 16:07:04,004 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:07:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1252159126, now seen corresponding path program 1 times [2024-11-13 16:07:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:07:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008322547] [2024-11-13 16:07:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:07:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:07:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:05,181 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-13 16:07:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:07:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008322547] [2024-11-13 16:07:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008322547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:07:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646130393] [2024-11-13 16:07:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:05,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:05,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:05,184 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:05,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 16:07:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:05,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 16:07:05,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:05,590 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-13 16:07:05,702 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-13 16:07:05,720 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:07:05,720 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-13 16:07:05,780 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-13 16:07:05,791 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-13 16:07:05,921 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-13 16:07:05,925 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-13 16:07:06,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:07:06,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 16:07:06,141 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-13 16:07:06,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:07:06,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-13 16:07:06,270 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-13 16:07:06,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:07:06,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:07:06,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:07:06,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:07:06,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 16:07:06,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-13 16:07:06,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:07:06,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:07:06,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:07:06,602 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-13 16:07:06,607 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-13 16:07:06,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:07:06,674 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-13 16:07:06,688 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 16:07:06,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 16:07:06,693 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-13 16:07:06,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:07:07,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2594))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2593) .cse1 v_ArrVal_2596) (select (select (store .cse2 .cse1 v_ArrVal_2595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2597))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int))) (or (forall ((v_ArrVal_2599 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2594))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2595))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2593) .cse4 v_ArrVal_2596) .cse5 v_ArrVal_2597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2599) (select (select (store .cse6 .cse5 v_ArrVal_2598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2024-11-13 16:07:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646130393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:07:23,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:07:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-11-13 16:07:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269535574] [2024-11-13 16:07:23,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:07:23,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 16:07:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:07:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 16:07:23,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1305, Unknown=68, NotChecked=76, Total=1640 [2024-11-13 16:07:23,441 INFO L87 Difference]: Start difference. First operand 1514 states and 1763 transitions. Second operand has 29 states, 26 states have (on average 6.153846153846154) internal successors, (160), 28 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-13 16:07:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:07:56,012 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-13 16:07:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:07:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.153846153846154) internal successors, (160), 28 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 99 [2024-11-13 16:07:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:07:56,014 INFO L225 Difference]: With dead ends: 1516 [2024-11-13 16:07:56,014 INFO L226 Difference]: Without dead ends: 1516 [2024-11-13 16:07:56,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=225, Invalid=1599, Unknown=72, NotChecked=84, Total=1980 [2024-11-13 16:07:56,015 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 1518 mSDsluCounter, 10736 mSDsCounter, 0 mSdLazyCounter, 10889 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 11775 SdHoareTripleChecker+Invalid, 10917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 10889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:07:56,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 11775 Invalid, 10917 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 10889 Invalid, 0 Unknown, 0 Unchecked, 31.7s Time] [2024-11-13 16:07:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-13 16:07:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1494. [2024-11-13 16:07:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1025 states have (on average 1.6760975609756097) internal successors, (1718), 1483 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:07:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2024-11-13 16:07:56,039 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 99 [2024-11-13 16:07:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:07:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2024-11-13 16:07:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.153846153846154) internal successors, (160), 28 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-13 16:07:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2024-11-13 16:07:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 16:07:56,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:56,040 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] [2024-11-13 16:07:56,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 16:07:56,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-13 16:07:56,241 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:07:56,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1216476783, now seen corresponding path program 1 times [2024-11-13 16:07:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:07:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050849067] [2024-11-13 16:07:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:07:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:07:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:58,838 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-13 16:07:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:07:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050849067] [2024-11-13 16:07:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050849067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 16:07:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085400104] [2024-11-13 16:07:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:07:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:07:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:07:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:07:58,840 INFO L87 Difference]: Start difference. First operand 1494 states and 1742 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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-13 16:08:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:08:25,315 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-13 16:08:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:08:25,315 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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 101 [2024-11-13 16:08:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:08:25,317 INFO L225 Difference]: With dead ends: 1520 [2024-11-13 16:08:25,317 INFO L226 Difference]: Without dead ends: 1520 [2024-11-13 16:08:25,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2024-11-13 16:08:25,318 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 1552 mSDsluCounter, 11640 mSDsCounter, 0 mSdLazyCounter, 9937 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 9965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:08:25,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 12680 Invalid, 9965 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 9937 Invalid, 0 Unknown, 0 Unchecked, 25.4s Time] [2024-11-13 16:08:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-13 16:08:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1516. [2024-11-13 16:08:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1046 states have (on average 1.6644359464627152) internal successors, (1741), 1504 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:08:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1766 transitions. [2024-11-13 16:08:25,332 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1766 transitions. Word has length 101 [2024-11-13 16:08:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:08:25,332 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1766 transitions. [2024-11-13 16:08:25,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 states have internal predecessors, (99), 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-13 16:08:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1766 transitions. [2024-11-13 16:08:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 16:08:25,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:08:25,333 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] [2024-11-13 16:08:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 16:08:25,333 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:08:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:08:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1216476782, now seen corresponding path program 1 times [2024-11-13 16:08:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:08:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650199043] [2024-11-13 16:08:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:08:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:26,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:08:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:26,683 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-13 16:08:26,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:08:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650199043] [2024-11-13 16:08:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650199043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:08:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:08:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 16:08:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059301070] [2024-11-13 16:08:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:08:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 16:08:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:08:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 16:08:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:08:26,685 INFO L87 Difference]: Start difference. First operand 1516 states and 1766 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-13 16:08:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:08:44,294 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-13 16:08:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 16:08:44,295 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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 101 [2024-11-13 16:08:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:08:44,297 INFO L225 Difference]: With dead ends: 1519 [2024-11-13 16:08:44,297 INFO L226 Difference]: Without dead ends: 1519 [2024-11-13 16:08:44,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-13 16:08:44,298 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 1551 mSDsluCounter, 11227 mSDsCounter, 0 mSdLazyCounter, 7100 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 12274 SdHoareTripleChecker+Invalid, 7125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:08:44,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 12274 Invalid, 7125 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7100 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2024-11-13 16:08:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-13 16:08:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1516. [2024-11-13 16:08:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1046 states have (on average 1.6634799235181645) internal successors, (1740), 1504 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:08:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1765 transitions. [2024-11-13 16:08:44,315 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1765 transitions. Word has length 101 [2024-11-13 16:08:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:08:44,315 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1765 transitions. [2024-11-13 16:08:44,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-13 16:08:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1765 transitions. [2024-11-13 16:08:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 16:08:44,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:08:44,317 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-13 16:08:44,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 16:08:44,317 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:08:44,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:08:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1280939225, now seen corresponding path program 1 times [2024-11-13 16:08:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:08:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650325341] [2024-11-13 16:08:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:08:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:08:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:46,563 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-13 16:08:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:08:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650325341] [2024-11-13 16:08:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650325341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:08:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622344523] [2024-11-13 16:08:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:46,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:08:46,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:08:46,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:08:46,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 16:08:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:46,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 16:08:46,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:08:46,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-13 16:08:47,366 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-13 16:08:47,441 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 16:08:47,442 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-13 16:08:47,592 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-13 16:08:47,613 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-13 16:08:48,034 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-13 16:08:48,043 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-13 16:08:48,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:08:48,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 16:08:48,721 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-13 16:08:49,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:08:49,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:08:49,171 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-13 16:08:49,484 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:08:49,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:08:49,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:08:49,887 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:08:49,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:08:49,925 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-13 16:08:50,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:08:50,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:08:50,243 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-13 16:08:50,643 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-13 16:08:50,643 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-13 16:08:50,652 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-13 16:08:50,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:08:50,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:08:50,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:08:50,812 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-13 16:08:50,820 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-13 16:08:50,827 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-13 16:08:50,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:08:51,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2985 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2985 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 16:08:51,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2982) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2984 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2983))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2982) .cse1 v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2984) (select (select (store .cse2 .cse1 v_ArrVal_2986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-13 16:08:52,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2984 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2980))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2983))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2981) .cse0 v_ArrVal_2982) .cse1 v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2984) (select (select (store .cse3 .cse1 v_ArrVal_2986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2980))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2981) .cse5 v_ArrVal_2982) (select (select (store .cse6 .cse5 v_ArrVal_2983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2985))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))))) is different from false [2024-11-13 16:08:52,586 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2979 (Array Int Int)) (v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2978))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2980))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2979) .cse0 v_ArrVal_2981) .cse1 v_ArrVal_2982) (select (select (store .cse2 .cse1 v_ArrVal_2983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2985))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2979 (Array Int Int)) (v_ArrVal_2978 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2984 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2978))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2980))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2983))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2979) .cse5 v_ArrVal_2981) .cse6 v_ArrVal_2982) .cse7 v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2984) (select (select (store .cse8 .cse7 v_ArrVal_2986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-13 16:09:04,020 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_2979 (Array Int Int)) (v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2977))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2978))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2980))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2976) .cse1 v_ArrVal_2979) .cse2 v_ArrVal_2981) .cse3 v_ArrVal_2982) (select (select (store .cse4 .cse3 v_ArrVal_2983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2985))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))) (forall ((v_ArrVal_2979 (Array Int Int)) (v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2983 (Array Int Int)) (v_ArrVal_2982 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (or (forall ((v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2984 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2977))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_2978))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2980))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2983))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2976) .cse8 v_ArrVal_2979) .cse9 v_ArrVal_2981) .cse10 v_ArrVal_2982) .cse11 v_ArrVal_2985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2984) (select (select (store .cse12 .cse11 v_ArrVal_2986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))))))) is different from false [2024-11-13 16:09:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622344523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:09:13,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:09:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2024-11-13 16:09:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312647043] [2024-11-13 16:09:13,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:09:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 16:09:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:09:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 16:09:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1235, Unknown=37, NotChecked=390, Total=1892 [2024-11-13 16:09:13,671 INFO L87 Difference]: Start difference. First operand 1516 states and 1765 transitions. Second operand has 30 states, 27 states have (on average 6.148148148148148) internal successors, (166), 29 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-13 16:10:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:10:08,703 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-13 16:10:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:10:08,703 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.148148148148148) internal successors, (166), 29 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 102 [2024-11-13 16:10:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:10:08,705 INFO L225 Difference]: With dead ends: 1518 [2024-11-13 16:10:08,705 INFO L226 Difference]: Without dead ends: 1518 [2024-11-13 16:10:08,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=262, Invalid=1527, Unknown=37, NotChecked=430, Total=2256 [2024-11-13 16:10:08,707 INFO L432 NwaCegarLoop]: 1038 mSDtfsCounter, 1521 mSDsluCounter, 9183 mSDsCounter, 0 mSdLazyCounter, 9280 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 10221 SdHoareTripleChecker+Invalid, 9310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 9280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:10:08,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 10221 Invalid, 9310 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 9280 Invalid, 0 Unknown, 0 Unchecked, 53.9s Time] [2024-11-13 16:10:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-13 16:10:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2024-11-13 16:10:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1046 states have (on average 1.6625239005736139) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:10:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1764 transitions. [2024-11-13 16:10:08,728 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1764 transitions. Word has length 102 [2024-11-13 16:10:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:10:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1764 transitions. [2024-11-13 16:10:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.148148148148148) internal successors, (166), 29 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-13 16:10:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1764 transitions. [2024-11-13 16:10:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 16:10:08,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:10:08,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:10:08,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 16:10:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 16:10:08,931 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:10:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:10:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1280939226, now seen corresponding path program 1 times [2024-11-13 16:10:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:10:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920886505] [2024-11-13 16:10:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:10:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:10:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:10:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:11,363 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-13 16:10:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:10:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920886505] [2024-11-13 16:10:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920886505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:10:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288131382] [2024-11-13 16:10:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:10:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:10:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:10:11,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:10:11,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 16:10:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:11,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 16:10:11,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:10:12,047 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-13 16:10:12,395 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-13 16:10:12,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 48 [2024-11-13 16:10:12,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:10:12,816 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 55 treesize of output 44 [2024-11-13 16:10:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:10:12,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:10:12,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288131382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:10:12,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:10:12,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 20 [2024-11-13 16:10:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931513736] [2024-11-13 16:10:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:10:13,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:10:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:10:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:10:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-13 16:10:13,001 INFO L87 Difference]: Start difference. First operand 1515 states and 1764 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 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-13 16:10:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:10:21,390 INFO L93 Difference]: Finished difference Result 1514 states and 1763 transitions. [2024-11-13 16:10:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:10:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 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-13 16:10:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:10:21,394 INFO L225 Difference]: With dead ends: 1514 [2024-11-13 16:10:21,394 INFO L226 Difference]: Without dead ends: 1514 [2024-11-13 16:10:21,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-11-13 16:10:21,395 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 1 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:10:21,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5103 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-13 16:10:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-13 16:10:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1492. [2024-11-13 16:10:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1025 states have (on average 1.6741463414634146) internal successors, (1716), 1481 states have internal predecessors, (1716), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:10:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2024-11-13 16:10:21,413 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 102 [2024-11-13 16:10:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:10:21,413 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2024-11-13 16:10:21,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 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-13 16:10:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2024-11-13 16:10:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 16:10:21,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:10:21,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:10:21,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 16:10:21,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-13 16:10:21,615 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:10:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:10:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -873576664, now seen corresponding path program 1 times [2024-11-13 16:10:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:10:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945580503] [2024-11-13 16:10:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:10:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:10:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:10:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:23,920 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-13 16:10:23,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:10:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945580503] [2024-11-13 16:10:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945580503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:10:23,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:10:23,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 16:10:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043164806] [2024-11-13 16:10:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:10:23,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 16:10:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:10:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 16:10:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:10:23,923 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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-13 16:10:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:10:48,008 INFO L93 Difference]: Finished difference Result 1543 states and 1799 transitions. [2024-11-13 16:10:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:10:48,009 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2024-11-13 16:10:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:10:48,011 INFO L225 Difference]: With dead ends: 1543 [2024-11-13 16:10:48,011 INFO L226 Difference]: Without dead ends: 1543 [2024-11-13 16:10:48,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-13 16:10:48,012 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1650 mSDsluCounter, 7215 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 8259 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:10:48,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 8259 Invalid, 4906 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 4861 Invalid, 0 Unknown, 0 Unchecked, 23.0s Time] [2024-11-13 16:10:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-13 16:10:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1517. [2024-11-13 16:10:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1049 states have (on average 1.6606291706387035) internal successors, (1742), 1505 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:10:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1767 transitions. [2024-11-13 16:10:48,036 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1767 transitions. Word has length 104 [2024-11-13 16:10:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:10:48,036 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1767 transitions. [2024-11-13 16:10:48,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 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-13 16:10:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1767 transitions. [2024-11-13 16:10:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 16:10:48,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:10:48,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:10:48,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 16:10:48,038 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:10:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:10:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -873576663, now seen corresponding path program 1 times [2024-11-13 16:10:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:10:48,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192048351] [2024-11-13 16:10:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:10:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:10:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:10:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:10:50,856 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-13 16:10:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:10:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192048351] [2024-11-13 16:10:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192048351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:10:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:10:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 16:10:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409521916] [2024-11-13 16:10:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:10:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 16:10:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:10:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 16:10:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:10:50,858 INFO L87 Difference]: Start difference. First operand 1517 states and 1767 transitions. Second operand has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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-13 16:11:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:11:31,331 INFO L93 Difference]: Finished difference Result 1542 states and 1798 transitions. [2024-11-13 16:11:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:11:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2024-11-13 16:11:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:11:31,333 INFO L225 Difference]: With dead ends: 1542 [2024-11-13 16:11:31,334 INFO L226 Difference]: Without dead ends: 1542 [2024-11-13 16:11:31,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 16:11:31,335 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 1633 mSDsluCounter, 11783 mSDsCounter, 0 mSdLazyCounter, 8162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 12823 SdHoareTripleChecker+Invalid, 8192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 8162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:11:31,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 12823 Invalid, 8192 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 8162 Invalid, 0 Unknown, 0 Unchecked, 39.2s Time] [2024-11-13 16:11:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-13 16:11:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1517. [2024-11-13 16:11:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1049 states have (on average 1.659675881792183) internal successors, (1741), 1505 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:11:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-13 16:11:31,350 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 104 [2024-11-13 16:11:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:11:31,350 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-13 16:11:31,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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-13 16:11:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-13 16:11:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:11:31,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:11:31,351 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] [2024-11-13 16:11:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 16:11:31,351 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:11:31,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:11:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 324597616, now seen corresponding path program 1 times [2024-11-13 16:11:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:11:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722789031] [2024-11-13 16:11:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:11:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:11:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:11:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:11:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:11:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:11:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:11:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722789031] [2024-11-13 16:11:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722789031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:11:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:11:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:11:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587066744] [2024-11-13 16:11:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:11:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:11:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:11:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:11:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:11:33,026 INFO L87 Difference]: Start difference. First operand 1517 states and 1766 transitions. Second operand has 11 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-13 16:11:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:11:57,082 INFO L93 Difference]: Finished difference Result 1533 states and 1787 transitions. [2024-11-13 16:11:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:11:57,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 105 [2024-11-13 16:11:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:11:57,085 INFO L225 Difference]: With dead ends: 1533 [2024-11-13 16:11:57,085 INFO L226 Difference]: Without dead ends: 1533 [2024-11-13 16:11:57,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:11:57,086 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1622 mSDsluCounter, 7138 mSDsCounter, 0 mSdLazyCounter, 4736 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:11:57,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 8181 Invalid, 4762 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 4736 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2024-11-13 16:11:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-13 16:11:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1516. [2024-11-13 16:11:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1049 states have (on average 1.6587225929456626) internal successors, (1740), 1504 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-13 16:11:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1765 transitions. [2024-11-13 16:11:57,101 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1765 transitions. Word has length 105 [2024-11-13 16:11:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:11:57,101 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1765 transitions. [2024-11-13 16:11:57,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-13 16:11:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1765 transitions. [2024-11-13 16:11:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 16:11:57,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:11:57,102 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] [2024-11-13 16:11:57,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 16:11:57,102 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:11:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:11:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 324597617, now seen corresponding path program 1 times [2024-11-13 16:11:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:11:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178486932] [2024-11-13 16:11:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:11:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:11:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:12:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:00,526 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-13 16:12:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:12:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178486932] [2024-11-13 16:12:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178486932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:12:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813100922] [2024-11-13 16:12:00,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:12:00,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:12:00,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:12:00,529 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:12:00,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 16:12:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:12:01,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 16:12:01,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:12:01,057 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-13 16:12:01,769 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:12:01,769 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-13 16:12:01,917 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-13 16:12:02,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:02,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:12:02,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:02,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:12:03,151 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:03,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 16:12:03,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:03,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:12:03,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:03,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:12:04,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:04,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-13 16:12:04,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-13 16:12:04,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:12:04,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-13 16:12:04,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-13 16:12:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-13 16:12:04,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-13 16:12:05,042 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-13 16:12:05,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:12:05,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3685 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3685 (Array Int Int)) (v_ArrVal_3686 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 16:12:05,374 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3685 (Array Int Int)) (v_ArrVal_3686 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3685 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 16:12:05,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:12:05,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2024-11-13 16:12:05,907 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 331 treesize of output 301 [2024-11-13 16:12:05,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 245 [2024-11-13 16:12:05,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 241 [2024-11-13 16:12:05,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 233 [2024-11-13 16:12:05,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 229 [2024-11-13 16:12:06,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3682 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 16:12:06,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3681))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3682)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 16:12:11,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3679))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3680)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3681)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3682)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 16:12:11,990 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3681 (Array Int Int)) (v_ArrVal_3682 (Array Int Int)) (v_ArrVal_3689 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3689))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3679)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3680)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3681)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3682)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-13 16:12:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813100922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:12:11,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:12:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-13 16:12:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031100725] [2024-11-13 16:12:11,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:12:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 16:12:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:12:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 16:12:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1317, Unknown=34, NotChecked=474, Total=1980 [2024-11-13 16:12:11,998 INFO L87 Difference]: Start difference. First operand 1516 states and 1765 transitions. Second operand has 32 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 31 states have internal predecessors, (173), 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-13 16:13:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:19,467 INFO L93 Difference]: Finished difference Result 1532 states and 1786 transitions. [2024-11-13 16:13:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:13:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 31 states have internal predecessors, (173), 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 105 [2024-11-13 16:13:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:19,469 INFO L225 Difference]: With dead ends: 1532 [2024-11-13 16:13:19,469 INFO L226 Difference]: Without dead ends: 1532 [2024-11-13 16:13:19,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=283, Invalid=2257, Unknown=34, NotChecked=618, Total=3192 [2024-11-13 16:13:19,471 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 1624 mSDsluCounter, 19508 mSDsCounter, 0 mSdLazyCounter, 13350 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 20547 SdHoareTripleChecker+Invalid, 13412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 13350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:19,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 20547 Invalid, 13412 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [62 Valid, 13350 Invalid, 0 Unknown, 0 Unchecked, 64.6s Time] [2024-11-13 16:13:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-13 16:13:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1490. [2024-11-13 16:13:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1025 states have (on average 1.6721951219512194) internal successors, (1714), 1479 states have internal predecessors, (1714), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:13:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1738 transitions. [2024-11-13 16:13:19,487 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1738 transitions. Word has length 105 [2024-11-13 16:13:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:19,487 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1738 transitions. [2024-11-13 16:13:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 31 states have internal predecessors, (173), 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-13 16:13:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1738 transitions. [2024-11-13 16:13:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:13:19,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:19,488 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-13 16:13:19,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 16:13:19,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:13:19,689 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:13:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1514876478, now seen corresponding path program 1 times [2024-11-13 16:13:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625818738] [2024-11-13 16:13:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:13:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,968 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-13 16:13:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625818738] [2024-11-13 16:13:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625818738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:13:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119453676] [2024-11-13 16:13:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:19,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:19,970 INFO L87 Difference]: Start difference. First operand 1490 states and 1738 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 16:13:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:28,782 INFO L93 Difference]: Finished difference Result 1509 states and 1763 transitions. [2024-11-13 16:13:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:28,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 107 [2024-11-13 16:13:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:28,785 INFO L225 Difference]: With dead ends: 1509 [2024-11-13 16:13:28,785 INFO L226 Difference]: Without dead ends: 1509 [2024-11-13 16:13:28,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:28,786 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 29 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6291 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:28,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6291 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-13 16:13:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-13 16:13:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1489. [2024-11-13 16:13:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1025 states have (on average 1.6712195121951219) internal successors, (1713), 1478 states have internal predecessors, (1713), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:13:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1737 transitions. [2024-11-13 16:13:28,808 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1737 transitions. Word has length 107 [2024-11-13 16:13:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:28,808 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 1737 transitions. [2024-11-13 16:13:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 16:13:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1737 transitions. [2024-11-13 16:13:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 16:13:28,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:28,809 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-13 16:13:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 16:13:28,809 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:13:28,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1514876477, now seen corresponding path program 1 times [2024-11-13 16:13:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:28,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203465703] [2024-11-13 16:13:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:13:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,244 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-13 16:13:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203465703] [2024-11-13 16:13:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203465703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:13:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358975695] [2024-11-13 16:13:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:29,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:29,245 INFO L87 Difference]: Start difference. First operand 1489 states and 1737 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 16:13:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:38,295 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2024-11-13 16:13:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:38,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 107 [2024-11-13 16:13:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:38,297 INFO L225 Difference]: With dead ends: 1508 [2024-11-13 16:13:38,297 INFO L226 Difference]: Without dead ends: 1508 [2024-11-13 16:13:38,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:38,298 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 28 mSDsluCounter, 4715 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6305 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:38,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 6305 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-13 16:13:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2024-11-13 16:13:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1488. [2024-11-13 16:13:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1025 states have (on average 1.6702439024390243) internal successors, (1712), 1477 states have internal predecessors, (1712), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 16:13:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1736 transitions. [2024-11-13 16:13:38,314 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1736 transitions. Word has length 107 [2024-11-13 16:13:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:38,315 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1736 transitions. [2024-11-13 16:13:38,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-13 16:13:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1736 transitions. [2024-11-13 16:13:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:13:38,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:38,316 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] [2024-11-13 16:13:38,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 16:13:38,316 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:13:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 283470124, now seen corresponding path program 1 times [2024-11-13 16:13:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693728753] [2024-11-13 16:13:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:41,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:13:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:41,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693728753] [2024-11-13 16:13:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693728753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:41,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:41,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 16:13:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728438705] [2024-11-13 16:13:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:41,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 16:13:41,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:41,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 16:13:41,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:13:41,799 INFO L87 Difference]: Start difference. First operand 1488 states and 1736 transitions. Second operand has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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-13 16:14:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:15,078 INFO L93 Difference]: Finished difference Result 1536 states and 1792 transitions. [2024-11-13 16:14:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:14:15,078 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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 108 [2024-11-13 16:14:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:15,081 INFO L225 Difference]: With dead ends: 1536 [2024-11-13 16:14:15,081 INFO L226 Difference]: Without dead ends: 1536 [2024-11-13 16:14:15,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 16:14:15,082 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1639 mSDsluCounter, 10229 mSDsCounter, 0 mSdLazyCounter, 6568 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 11271 SdHoareTripleChecker+Invalid, 6602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:15,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 11271 Invalid, 6602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6568 Invalid, 0 Unknown, 0 Unchecked, 31.5s Time] [2024-11-13 16:14:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-13 16:14:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1517. [2024-11-13 16:14:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1053 states have (on average 1.6533713200379867) internal successors, (1741), 1505 states have internal predecessors, (1741), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-13 16:14:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1768 transitions. [2024-11-13 16:14:15,103 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1768 transitions. Word has length 108 [2024-11-13 16:14:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:15,104 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1768 transitions. [2024-11-13 16:14:15,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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-13 16:14:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1768 transitions. [2024-11-13 16:14:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 16:14:15,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:15,105 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] [2024-11-13 16:14:15,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 16:14:15,105 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:14:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash 283470125, now seen corresponding path program 1 times [2024-11-13 16:14:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930847919] [2024-11-13 16:14:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:14:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:19,075 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-13 16:14:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:19,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930847919] [2024-11-13 16:14:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930847919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 16:14:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927922649] [2024-11-13 16:14:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:19,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 16:14:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:19,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 16:14:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-13 16:14:19,077 INFO L87 Difference]: Start difference. First operand 1517 states and 1768 transitions. Second operand has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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-13 16:15:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:15:03,543 INFO L93 Difference]: Finished difference Result 1535 states and 1791 transitions. [2024-11-13 16:15:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 16:15:03,544 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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 108 [2024-11-13 16:15:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:15:03,546 INFO L225 Difference]: With dead ends: 1535 [2024-11-13 16:15:03,546 INFO L226 Difference]: Without dead ends: 1535 [2024-11-13 16:15:03,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 16:15:03,547 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1595 mSDsluCounter, 9972 mSDsCounter, 0 mSdLazyCounter, 8630 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 11020 SdHoareTripleChecker+Invalid, 8675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 8630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:15:03,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 11020 Invalid, 8675 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 8630 Invalid, 0 Unknown, 0 Unchecked, 42.5s Time] [2024-11-13 16:15:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-13 16:15:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1517. [2024-11-13 16:15:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1052 states have (on average 1.6539923954372624) internal successors, (1740), 1505 states have internal predecessors, (1740), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-13 16:15:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1767 transitions. [2024-11-13 16:15:03,568 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1767 transitions. Word has length 108 [2024-11-13 16:15:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:15:03,568 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1767 transitions. [2024-11-13 16:15:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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-13 16:15:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1767 transitions. [2024-11-13 16:15:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:15:03,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:15:03,570 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-13 16:15:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 16:15:03,570 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:15:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:15:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1198437748, now seen corresponding path program 1 times [2024-11-13 16:15:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:15:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121549220] [2024-11-13 16:15:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:15:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:15:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:07,688 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-13 16:15:07,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:15:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121549220] [2024-11-13 16:15:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121549220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242417653] [2024-11-13 16:15:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:15:07,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:15:07,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:15:07,691 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:15:07,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 16:15:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:15:08,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 16:15:08,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:15:08,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 16:15:08,969 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:15:08,970 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-13 16:15:09,132 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-13 16:15:09,152 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-13 16:15:09,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:15:09,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 16:15:09,678 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-13 16:15:09,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:15:09,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:15:09,993 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-13 16:15:10,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:15:10,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:15:10,306 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-13 16:15:10,600 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:15:10,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 16:15:10,611 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-13 16:15:10,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:15:10,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:15:10,929 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-13 16:15:11,238 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-13 16:15:11,555 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 16:15:11,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:15:11,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-13 16:15:12,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:15:12,214 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 16:15:12,215 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-13 16:15:12,236 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-13 16:15:12,344 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-13 16:15:12,619 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 16:15:12,619 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-13 16:15:12,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-13 16:15:12,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:12,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int))) (or (not (= (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse0 (select v_ArrVal_4279 .cse0))) v_ArrVal_4279)) (= 1 (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4279))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-13 16:15:12,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (not (= (let ((.cse1 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select |c_#memory_$Pointer$#2.base| .cse0) .cse1 (select v_ArrVal_4279 .cse1))) v_ArrVal_4279)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4279))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) 1))))) is different from false [2024-11-13 16:15:12,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4277)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4279 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select |c_#valid| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1))))) is different from false [2024-11-13 16:15:12,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 184 [2024-11-13 16:15:13,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4277)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4279))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4279 .cse5))) v_ArrVal_4279)))))) is different from false [2024-11-13 16:15:13,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| .cse6 (store (select |c_#memory_$Pointer$#2.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_4277)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4279 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))) is different from false [2024-11-13 16:15:13,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4272 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4273)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4272))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4277)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4279 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))) is different from false [2024-11-13 16:15:13,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4272 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4272))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4277)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4279))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4279 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4279 .cse5))))))))))))) is different from false [2024-11-13 16:15:14,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4272 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4271)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4270) .cse9 v_ArrVal_4272))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4277))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4279))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4279 .cse5))) v_ArrVal_4279)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-13 16:15:14,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4272 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4271))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4270) .cse10 v_ArrVal_4272))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4277))) (or (not (= v_ArrVal_4279 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))))) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-13 16:15:14,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4268 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4269 (Array Int Int)) (v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4272 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4268)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4271))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4269) .cse9 v_ArrVal_4270) .cse10 v_ArrVal_4272))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4277)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4279 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) is different from false [2024-11-13 16:15:14,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4268 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4269 (Array Int Int)) (v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int) (v_ArrVal_4272 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4268))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4271))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4269) .cse10 v_ArrVal_4270) .cse11 v_ArrVal_4272))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4277)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4279 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4279 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-13 16:15:14,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (v_ArrVal_4272 (Array Int Int)) (v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4267 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4268 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4269 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4266)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4268))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4271))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4267) .cse9 v_ArrVal_4269) .cse10 v_ArrVal_4270) .cse11 v_ArrVal_4272))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4277)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))) v_ArrVal_4279)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_15| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-13 16:15:15,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (v_ArrVal_4272 (Array Int Int)) (v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4267 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4268 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4269 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4266))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4268))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4271))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4267) .cse10 v_ArrVal_4269) .cse11 v_ArrVal_4270) .cse12 v_ArrVal_4272))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4277)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4279 .cse4))) v_ArrVal_4279)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))))))))))) is different from false [2024-11-13 16:15:15,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4270 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_15| Int) (v_ArrVal_4271 (Array Int Int)) (v_ArrVal_4272 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4273 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4277 (Array Int Int)) (v_ArrVal_4267 (Array Int Int)) (v_ArrVal_4278 (Array Int Int)) (v_ArrVal_4268 (Array Int Int)) (v_ArrVal_4279 (Array Int Int)) (v_ArrVal_4269 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_12| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4284)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4266))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4268))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4271))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4273))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4285) .cse9 v_ArrVal_4267) .cse10 v_ArrVal_4269) .cse11 v_ArrVal_4270) .cse12 v_ArrVal_4272))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4277)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_12|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4279 .cse2))) v_ArrVal_4279)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_12| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4279))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_15|))))))))))))))) is different from false [2024-11-13 16:15:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242417653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:15:15,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:15:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2024-11-13 16:15:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312352234] [2024-11-13 16:15:15,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:15:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 16:15:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:15:15,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 16:15:15,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1024, Unknown=14, NotChecked=1078, Total=2256 [2024-11-13 16:15:15,618 INFO L87 Difference]: Start difference. First operand 1517 states and 1767 transitions. Second operand has 34 states, 31 states have (on average 5.67741935483871) internal successors, (176), 33 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:16:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:02,179 INFO L93 Difference]: Finished difference Result 1533 states and 1789 transitions. [2024-11-13 16:16:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 16:16:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.67741935483871) internal successors, (176), 33 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2024-11-13 16:16:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:02,182 INFO L225 Difference]: With dead ends: 1533 [2024-11-13 16:16:02,182 INFO L226 Difference]: Without dead ends: 1533 [2024-11-13 16:16:02,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=258, Invalid=2040, Unknown=14, NotChecked=1470, Total=3782 [2024-11-13 16:16:02,183 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1585 mSDsluCounter, 14357 mSDsCounter, 0 mSdLazyCounter, 8992 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 15399 SdHoareTripleChecker+Invalid, 9029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 8992 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:02,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 15399 Invalid, 9029 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 8992 Invalid, 2 Unknown, 0 Unchecked, 43.9s Time] [2024-11-13 16:16:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-13 16:16:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1516. [2024-11-13 16:16:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1052 states have (on average 1.653041825095057) internal successors, (1739), 1504 states have internal predecessors, (1739), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-13 16:16:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1766 transitions. [2024-11-13 16:16:02,196 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1766 transitions. Word has length 109 [2024-11-13 16:16:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:02,197 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1766 transitions. [2024-11-13 16:16:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.67741935483871) internal successors, (176), 33 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:16:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1766 transitions. [2024-11-13 16:16:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:16:02,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:02,198 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-13 16:16:02,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 16:16:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-13 16:16:02,399 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-13 16:16:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1198437749, now seen corresponding path program 1 times [2024-11-13 16:16:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:16:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672959583] [2024-11-13 16:16:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:16:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:16:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:06,365 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-13 16:16:06,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:16:06,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672959583] [2024-11-13 16:16:06,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672959583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:16:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140646416] [2024-11-13 16:16:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:16:06,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:16:06,368 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:16:06,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d2aef50-5734-4425-8c7e-fc24d480bb00/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 16:16:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:06,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 16:16:06,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:16:06,959 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-13 16:16:07,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 16:16:07,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 16:16:07,842 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-13 16:16:08,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:16:08,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 16:16:08,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:16:08,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 16:16:09,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:16:09,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:16:09,248 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-13 16:16:09,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:16:09,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:16:09,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 16:16:09,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:16:09,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-13 16:16:09,926 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-13 16:16:10,247 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-13 16:16:10,603 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 16:16:10,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-13 16:16:10,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-13 16:16:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:16:11,378 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 16:16:11,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-13 16:16:11,461 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-13 16:16:11,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-13 16:16:11,977 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-13 16:16:11,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-13 16:16:12,221 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-13 16:16:12,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:16:13,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4503 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4503 .cse1)) v_ArrVal_4503)) (forall ((v_ArrVal_4502 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_4502 .cse1)) v_ArrVal_4502)) (< 0 (+ (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4502))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1)))))) (forall ((v_ArrVal_4503 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4503 .cse1)) v_ArrVal_4503)) (forall ((v_ArrVal_4502 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_4502 .cse1)) v_ArrVal_4502)) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4502)) (.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4503))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))) is different from false [2024-11-13 16:16:13,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse8 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int)) (or (forall ((v_ArrVal_4503 (Array Int Int))) (let ((.cse7 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|))) (or (forall ((v_ArrVal_4502 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_4502)) (.cse3 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_4503))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 383 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (= v_ArrVal_4502 (store .cse6 .cse7 (select v_ArrVal_4502 .cse7)))))) (not (= v_ArrVal_4503 (store .cse8 .cse7 (select v_ArrVal_4503 .cse7))))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| .cse9) (forall ((v_ArrVal_4503 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|))) (or (not (= v_ArrVal_4503 (store .cse8 .cse10 (select v_ArrVal_4503 .cse10)))) (forall ((v_ArrVal_4502 (Array Int Int))) (or (not (= v_ArrVal_4502 (store .cse6 .cse10 (select v_ArrVal_4502 .cse10)))) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_4502))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1))))))))))))) is different from false [2024-11-13 16:16:14,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| |c_ULTIMATE.start_main_#t~malloc57#1.offset|)))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (select .cse5 .cse3)) (.cse8 (select .cse2 .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| .cse0) (forall ((v_ArrVal_4503 (Array Int Int))) (let ((.cse7 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|))) (or (forall ((v_ArrVal_4502 (Array Int Int))) (or (< 0 (+ (let ((.cse1 (store .cse5 .cse3 v_ArrVal_4502))) (select (select .cse1 (select (select (store .cse2 .cse3 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1)) (not (= v_ArrVal_4502 (store .cse6 .cse7 (select v_ArrVal_4502 .cse7)))))) (not (= (store .cse8 .cse7 (select v_ArrVal_4503 .cse7)) v_ArrVal_4503))))))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| .cse0) (forall ((v_ArrVal_4503 (Array Int Int))) (let ((.cse13 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|))) (or (forall ((v_ArrVal_4502 (Array Int Int))) (or (let ((.cse9 (store .cse5 .cse3 v_ArrVal_4502)) (.cse12 (store .cse2 .cse3 v_ArrVal_4503))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 383 (select (select .cse9 .cse10) .cse11)) (select |c_#length| (select (select .cse12 .cse10) .cse11))))) (not (= v_ArrVal_4502 (store .cse6 .cse13 (select v_ArrVal_4502 .cse13)))))) (not (= (store .cse8 .cse13 (select v_ArrVal_4503 .cse13)) v_ArrVal_4503))))))))))) is different from false [2024-11-13 16:16:14,095 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 757 treesize of output 664 [2024-11-13 16:16:15,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base|) |c_ULTIMATE.start_main_#t~mem56#1.offset| 0))) (.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int) (v_ArrVal_4502 (Array Int Int)) (v_ArrVal_4503 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4502))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= (store (select .cse1 .cse2) .cse5 (select v_ArrVal_4503 .cse5)) v_ArrVal_4503)) (not (= v_ArrVal_4502 (store (select .cse4 .cse2) .cse5 (select v_ArrVal_4502 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| .cse6))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (+ 40 v_prenex_60))) (or (< (let ((.cse8 (store .cse4 .cse10 v_prenex_61))) (select (select .cse8 (select (select (store .cse9 .cse10 v_prenex_62) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= (store (select .cse4 .cse10) .cse11 (select v_prenex_61 .cse11)) v_prenex_61)) (< v_prenex_60 .cse6) (not (= v_prenex_62 (store (select .cse9 .cse10) .cse11 (select v_prenex_62 .cse11)))))))) (forall ((v_prenex_61 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem56#1.offset| |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse15 (+ 40 v_prenex_60))) (or (= (select (let ((.cse12 (store .cse13 .cse14 v_prenex_62))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse4 .cse14 v_prenex_61) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) |v_ULTIMATE.start_main_#t~malloc57#1.base_18|) (not (= (store (select .cse4 .cse14) .cse15 (select v_prenex_61 .cse15)) v_prenex_61)) (< v_prenex_60 .cse6) (not (= v_prenex_62 (store (select .cse13 .cse14) .cse15 (select v_prenex_62 .cse15))))))))))) is different from false [2024-11-13 16:16:17,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4496 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int) (v_ArrVal_4497 (Array Int Int)) (v_ArrVal_4502 (Array Int Int)) (v_ArrVal_4503 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4496)) (.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4497))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0)))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4502 .cse2)) v_ArrVal_4502)) (not (= (store (select .cse3 .cse1) .cse2 (select v_ArrVal_4503 .cse2)) v_ArrVal_4503)) (< 0 (+ (let ((.cse4 (store .cse0 .cse1 v_ArrVal_4502))) (select (select .cse4 (select (select (store .cse3 .cse1 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4496)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4497))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse12 (+ 40 v_prenex_60)) (.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse10 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0)))) (or (not (= v_prenex_61 (store (select .cse10 .cse11) .cse12 (select v_prenex_61 .cse12)))) (not (= v_prenex_62 (store (select .cse13 .cse11) .cse12 (select v_prenex_62 .cse12)))) (= (select (let ((.cse14 (store .cse13 .cse11 v_prenex_62))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse10 .cse11 v_prenex_61) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) |v_ULTIMATE.start_main_#t~malloc57#1.base_18|) (< v_prenex_60 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4496)) (.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4497))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse23 (+ 40 v_prenex_60)) (.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0)))) (or (< (let ((.cse19 (store .cse22 .cse21 v_prenex_61))) (select (select .cse19 (select (select (store .cse20 .cse21 v_prenex_62) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (not (= v_prenex_61 (store (select .cse22 .cse21) .cse23 (select v_prenex_61 .cse23)))) (not (= v_prenex_62 (store (select .cse20 .cse21) .cse23 (select v_prenex_62 .cse23)))) (< v_prenex_60 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) is different from false [2024-11-13 16:16:18,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4496)) (.cse7 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4497))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse0 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse3 (+ 40 v_prenex_60))) (or (< v_prenex_60 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_61 (store (select .cse0 .cse2) .cse3 (select v_prenex_61 .cse3)))) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_61))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_62) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4497 .cse9 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_62 .cse3)) v_prenex_62)))))))) (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4496)) (.cse20 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4497))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse15 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0))) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 v_prenex_60))) (or (= (select (let ((.cse12 (store .cse13 .cse14 v_prenex_62))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse15 .cse14 v_prenex_61) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_18|) (< v_prenex_60 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_61 (store (select (store .cse16 .cse17 (store v_ArrVal_4496 .cse18 0)) .cse14) .cse19 (select v_prenex_61 .cse19)))) (not (= v_prenex_62 (store (select .cse13 .cse14) .cse19 (select v_prenex_62 .cse19)))))))))) (forall ((v_ArrVal_4496 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int) (v_ArrVal_4497 (Array Int Int)) (v_ArrVal_4502 (Array Int Int)) (v_ArrVal_4503 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4496)) (.cse22 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4497))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse25 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|)) (.cse27 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (store .cse30 .cse23 (store (select .cse30 .cse23) .cse24 0)))) (or (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4497 .cse24 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_ArrVal_4503 .cse25)) v_ArrVal_4503)) (not (= v_ArrVal_4502 (store (select .cse26 .cse27) .cse25 (select v_ArrVal_4502 .cse25)))) (< 0 (+ 1 (let ((.cse28 (store .cse26 .cse27 v_ArrVal_4502))) (select (select .cse28 (select (select (store .cse29 .cse27 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-13 16:16:20,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4495))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4494) .cse11 v_ArrVal_4496)) (.cse9 (store .cse10 .cse11 v_ArrVal_4497))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_60))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_prenex_62))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_prenex_61) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_18|) (< v_prenex_60 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse2 .cse3) .cse5 (select v_prenex_62 .cse5)) v_prenex_62)) (not (= v_prenex_61 (store (select (store .cse6 .cse7 (store v_ArrVal_4496 .cse8 0)) .cse3) .cse5 (select v_prenex_61 .cse5)))))))))))) (forall ((v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int) (v_ArrVal_4497 (Array Int Int)) (v_ArrVal_4502 (Array Int Int)) (v_ArrVal_4503 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int)) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4495))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4494) .cse23 v_ArrVal_4496)) (.cse18 (store .cse22 .cse23 v_ArrVal_4497))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|)) (.cse12 (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 0)))) (or (not (= v_ArrVal_4502 (store (select .cse12 .cse13) .cse14 (select v_ArrVal_4502 .cse14)))) (< 0 (+ (let ((.cse15 (store .cse12 .cse13 v_ArrVal_4502))) (select (select .cse15 (select (select (store .cse16 .cse13 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (let ((.cse17 (store .cse18 .cse19 (store v_ArrVal_4497 .cse20 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse14 (select v_ArrVal_4503 .cse14)) v_ArrVal_4503)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse34 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4495))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4494) .cse35 v_ArrVal_4496)) (.cse30 (store .cse34 .cse35 v_ArrVal_4497))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse24 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 0))) (.cse25 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (+ 40 v_prenex_60))) (or (not (= v_prenex_61 (store (select .cse24 .cse25) .cse26 (select v_prenex_61 .cse26)))) (< v_prenex_60 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse27 (store .cse24 .cse25 v_prenex_61))) (select (select .cse27 (select (select (store .cse28 .cse25 v_prenex_62) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (let ((.cse29 (store .cse30 .cse31 (store v_ArrVal_4497 .cse32 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse26 (select v_prenex_62 .cse26)) v_prenex_62)))))))))))) is different from false [2024-11-13 16:16:20,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4495))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4494) .cse12 v_ArrVal_4496)) (.cse6 (store .cse11 .cse12 v_ArrVal_4497))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (+ 40 v_prenex_60)) (.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (or (< (let ((.cse0 (store .cse4 .cse2 v_prenex_61))) (select (select .cse0 (select (select (store .cse1 .cse2 v_prenex_62) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= v_prenex_62 (store (let ((.cse5 (store .cse6 .cse7 (store v_ArrVal_4497 .cse8 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse9 (select v_prenex_62 .cse9)))) (not (= (store (select .cse4 .cse2) .cse9 (select v_prenex_61 .cse9)) v_prenex_61)) (< v_prenex_60 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int) (v_ArrVal_4497 (Array Int Int)) (v_ArrVal_4502 (Array Int Int)) (v_ArrVal_4503 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4495))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse23 (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4494) .cse25 v_ArrVal_4496)) (.cse20 (store .cse24 .cse25 v_ArrVal_4497))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse15 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse18 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|)) (.cse17 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 0)))) (or (< 0 (+ (let ((.cse14 (store .cse17 .cse16 v_ArrVal_4502))) (select (select .cse14 (select (select (store .cse15 .cse16 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= v_ArrVal_4502 (store (select .cse17 .cse16) .cse18 (select v_ArrVal_4502 .cse18)))) (not (= (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4497 .cse22 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse18 (select v_ArrVal_4503 .cse18)) v_ArrVal_4503)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_prenex_61 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_prenex_60 Int)) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4495))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4494) .cse36 v_ArrVal_4496)) (.cse34 (store .cse35 .cse36 v_ArrVal_4497))) (let ((.cse27 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse28 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse31 (store .cse34 .cse27 (store (select .cse34 .cse27) .cse28 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse30 (+ 40 v_prenex_60)) (.cse32 (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 0))) (.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (store (select (store .cse26 .cse27 (store v_ArrVal_4496 .cse28 0)) .cse29) .cse30 (select v_prenex_61 .cse30)) v_prenex_61)) (not (= v_prenex_62 (store (select .cse31 .cse29) .cse30 (select v_prenex_62 .cse30)))) (< v_prenex_60 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (= (select (let ((.cse33 (store .cse31 .cse29 v_prenex_62))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse32 .cse29 v_prenex_61) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))))))))))) is different from false [2024-11-13 16:16:22,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4493 (Array Int Int)) (v_prenex_61 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_ArrVal_4492 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4493))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4495))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4492) .cse13 v_ArrVal_4494) .cse12 v_ArrVal_4496)) (.cse2 (store .cse11 .cse12 v_ArrVal_4497))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_60))) (or (not (= v_prenex_62 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4497 .cse4 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_62 .cse5)))) (< v_prenex_60 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse7 (store .cse6 .cse9 v_prenex_61))) (select (select .cse7 (select (select (store .cse8 .cse9 v_prenex_62) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse6 .cse9) .cse5 (select v_prenex_61 .cse5)) v_prenex_61)))))))))))) (forall ((v_ArrVal_4493 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_15| Int) (v_ArrVal_4497 (Array Int Int)) (v_ArrVal_4502 (Array Int Int)) (v_ArrVal_4503 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_ArrVal_4492 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4493))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4495))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4492) .cse27 v_ArrVal_4494) .cse26 v_ArrVal_4496)) (.cse21 (store .cse25 .cse26 v_ArrVal_4497))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse18 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_15|))) (or (< 0 (+ (let ((.cse15 (store .cse18 .cse17 v_ArrVal_4502))) (select (select .cse15 (select (select (store .cse16 .cse17 v_ArrVal_4503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_15| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4502 (store (select .cse18 .cse17) .cse19 (select v_ArrVal_4502 .cse19)))) (not (= v_ArrVal_4503 (store (let ((.cse20 (store .cse21 .cse22 (store v_ArrVal_4497 .cse23 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse19 (select v_ArrVal_4503 .cse19)))))))))))))) (forall ((v_ArrVal_4493 (Array Int Int)) (v_prenex_61 (Array Int Int)) (v_ArrVal_4494 (Array Int Int)) (v_ArrVal_4495 (Array Int Int)) (v_ArrVal_4496 (Array Int Int)) (v_ArrVal_4497 (Array Int Int)) (v_prenex_62 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_18| Int) (v_ArrVal_4492 (Array Int Int)) (v_prenex_60 Int)) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4493))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4495))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4492) .cse40 v_ArrVal_4494) .cse39 v_ArrVal_4496)) (.cse37 (store .cse38 .cse39 v_ArrVal_4497))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_18|)))) (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0))) (.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (+ 40 v_prenex_60))) (or (= (select (let ((.cse29 (store .cse30 .cse31 v_prenex_62))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse32 .cse31 v_prenex_61) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_18|) (< v_prenex_60 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse30 .cse31) .cse33 (select v_prenex_62 .cse33)) v_prenex_62)) (not (= v_prenex_61 (store (select (store .cse34 .cse35 (store v_ArrVal_4496 .cse36 0)) .cse31) .cse33 (select v_prenex_61 .cse33)))))))))))))))) is different from false [2024-11-13 16:16:51,440 WARN L286 SmtUtils]: Spent 20.43s on a formula simplification. DAG size of input: 242 DAG size of output: 120 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 16:16:51,441 INFO L349 Elim1Store]: treesize reduction 15223, result has 36.3 percent of original size [2024-11-13 16:16:51,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 55846144148671 treesize of output 53916709011505 [2024-11-13 16:17:39,536 WARN L286 SmtUtils]: Spent 47.94s on a formula simplification. DAG size of input: 42925 DAG size of output: 2931 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:45,267 INFO L224 Elim1Store]: Index analysis took 1278 ms