./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:19:43,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:19:43,735 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:19:43,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:19:43,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:19:43,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:19:43,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:19:43,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:19:43,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:19:43,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:19:43,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:19:43,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:19:43,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:19:43,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:19:43,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:19:43,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:19:43,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:19:43,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:19:43,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:19:43,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:19:43,776 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:19:43,777 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:19:43,777 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:19:43,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:19:43,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:19:43,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:19:43,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:19:43,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:19:43,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:19:43,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:19:43,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:19:43,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:19:43,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:19:43,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:19:43,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:19:43,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:19:43,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:19:43,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:19:43,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:19:43,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:19:43,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:19:43,780 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_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-28 03:19:44,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:19:44,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:19:44,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:19:44,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:19:44,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:19:44,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-28 03:19:47,769 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/data/dc6915ca7/79a7d689a3744850b6c99391db8de313/FLAG069785168 [2024-11-28 03:19:48,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:19:48,245 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-28 03:19:48,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/data/dc6915ca7/79a7d689a3744850b6c99391db8de313/FLAG069785168 [2024-11-28 03:19:48,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/data/dc6915ca7/79a7d689a3744850b6c99391db8de313 [2024-11-28 03:19:48,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:19:48,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:19:48,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:19:48,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:19:48,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:19:48,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:19:48" (1/1) ... [2024-11-28 03:19:48,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d52c2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:48, skipping insertion in model container [2024-11-28 03:19:48,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:19:48" (1/1) ... [2024-11-28 03:19:48,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:19:48,917 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:48,958 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:48,963 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:48,969 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:48,978 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:49,024 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:49,024 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:49,028 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:49,028 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:19:49,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:19:49,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:19:49,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:19:49,324 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:19:49,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49 WrapperNode [2024-11-28 03:19:49,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:19:49,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:19:49,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:19:49,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:19:49,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,432 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-28 03:19:49,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:19:49,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:19:49,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:19:49,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:19:49,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,542 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-28 03:19:49,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:19:49,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:19:49,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:19:49,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:19:49,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (1/1) ... [2024-11-28 03:19:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:19:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:19:49,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:19:49,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:19:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 03:19:49,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 03:19:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 03:19:49,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 03:19:49,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 03:19:49,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:19:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:19:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:19:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:19:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:19:49,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:19:50,028 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:19:50,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:19:50,036 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:19:50,109 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:19:50,139 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:19:53,304 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-28 03:19:53,304 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:19:53,360 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:19:53,361 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-28 03:19:53,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:19:53 BoogieIcfgContainer [2024-11-28 03:19:53,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:19:53,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:19:53,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:19:53,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:19:53,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:19:48" (1/3) ... [2024-11-28 03:19:53,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f045939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:19:53, skipping insertion in model container [2024-11-28 03:19:53,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:19:49" (2/3) ... [2024-11-28 03:19:53,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f045939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:19:53, skipping insertion in model container [2024-11-28 03:19:53,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:19:53" (3/3) ... [2024-11-28 03:19:53,387 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-11-28 03:19:53,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:19:53,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test2-1.i that has 4 procedures, 1064 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-11-28 03:19:53,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:19:53,526 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;@2a09e738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:19:53,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-28 03:19:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:19:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:19:53,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:19:53,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:19:53,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:19:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1758863, now seen corresponding path program 1 times [2024-11-28 03:19:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270567759] [2024-11-28 03:19:53,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:19:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270567759] [2024-11-28 03:19:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270567759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:19:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163158696] [2024-11-28 03:19:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:53,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:19:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:19:54,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:19:54,007 INFO L87 Difference]: Start difference. First operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:19:55,761 INFO L93 Difference]: Finished difference Result 1351 states and 1604 transitions. [2024-11-28 03:19:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:19:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 03:19:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:19:55,789 INFO L225 Difference]: With dead ends: 1351 [2024-11-28 03:19:55,793 INFO L226 Difference]: Without dead ends: 1347 [2024-11-28 03:19:55,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:19:55,801 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 383 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:19:55,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2651 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 03:19:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-28 03:19:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1261. [2024-11-28 03:19:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 845 states have (on average 1.8804733727810652) internal successors, (1589), 1256 states have internal predecessors, (1589), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:19:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1595 transitions. [2024-11-28 03:19:55,951 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1595 transitions. Word has length 4 [2024-11-28 03:19:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:19:55,951 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1595 transitions. [2024-11-28 03:19:55,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1595 transitions. [2024-11-28 03:19:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:19:55,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:19:55,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:19:55,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:19:55,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:19:55,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-28 03:19:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581029307] [2024-11-28 03:19:55,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:56,093 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-28 03:19:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581029307] [2024-11-28 03:19:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581029307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:56,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275957886] [2024-11-28 03:19:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:56,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:56,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:56,096 INFO L87 Difference]: Start difference. First operand 1261 states and 1595 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:19:56,932 INFO L93 Difference]: Finished difference Result 1258 states and 1587 transitions. [2024-11-28 03:19:56,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:56,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 03:19:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:19:56,938 INFO L225 Difference]: With dead ends: 1258 [2024-11-28 03:19:56,938 INFO L226 Difference]: Without dead ends: 1258 [2024-11-28 03:19:56,939 INFO L434 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-28 03:19:56,940 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1087 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:19:56,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 862 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:19:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-28 03:19:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1258. [2024-11-28 03:19:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 853 states have (on average 1.8534583821805393) internal successors, (1581), 1253 states have internal predecessors, (1581), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:19:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1587 transitions. [2024-11-28 03:19:56,985 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1587 transitions. Word has length 4 [2024-11-28 03:19:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:19:56,985 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1587 transitions. [2024-11-28 03:19:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1587 transitions. [2024-11-28 03:19:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:19:56,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:19:56,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:19:56,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:19:56,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:19:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-28 03:19:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575573966] [2024-11-28 03:19:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:57,111 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-28 03:19:57,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575573966] [2024-11-28 03:19:57,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575573966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:57,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:57,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883689222] [2024-11-28 03:19:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:57,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:57,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:57,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:57,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:57,117 INFO L87 Difference]: Start difference. First operand 1258 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:19:58,515 INFO L93 Difference]: Finished difference Result 2018 states and 2492 transitions. [2024-11-28 03:19:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:58,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 03:19:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:19:58,525 INFO L225 Difference]: With dead ends: 2018 [2024-11-28 03:19:58,525 INFO L226 Difference]: Without dead ends: 2018 [2024-11-28 03:19:58,526 INFO L434 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-28 03:19:58,527 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 904 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:19:58,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1695 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 03:19:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-11-28 03:19:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1756. [2024-11-28 03:19:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1352 states have (on average 1.827662721893491) internal successors, (2471), 1749 states have internal predecessors, (2471), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:19:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2481 transitions. [2024-11-28 03:19:58,590 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2481 transitions. Word has length 4 [2024-11-28 03:19:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:19:58,590 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2481 transitions. [2024-11-28 03:19:58,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2481 transitions. [2024-11-28 03:19:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:19:58,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:19:58,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:58,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:19:58,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:19:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235122, now seen corresponding path program 1 times [2024-11-28 03:19:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385498826] [2024-11-28 03:19:58,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:58,732 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-28 03:19:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385498826] [2024-11-28 03:19:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385498826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:58,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:58,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378876340] [2024-11-28 03:19:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:58,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:58,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:58,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:58,736 INFO L87 Difference]: Start difference. First operand 1756 states and 2481 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:19:59,706 INFO L93 Difference]: Finished difference Result 1795 states and 2413 transitions. [2024-11-28 03:19:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:19:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-28 03:19:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:19:59,715 INFO L225 Difference]: With dead ends: 1795 [2024-11-28 03:19:59,715 INFO L226 Difference]: Without dead ends: 1795 [2024-11-28 03:19:59,716 INFO L434 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-28 03:19:59,719 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 1072 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:19:59,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1421 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:19:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-28 03:19:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1709. [2024-11-28 03:19:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1352 states have (on average 1.7751479289940828) internal successors, (2400), 1702 states have internal predecessors, (2400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:19:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2410 transitions. [2024-11-28 03:19:59,778 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2410 transitions. Word has length 10 [2024-11-28 03:19:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:19:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2410 transitions. [2024-11-28 03:19:59,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:19:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2410 transitions. [2024-11-28 03:19:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:19:59,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:19:59,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:19:59,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:19:59,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:19:59,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:19:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235123, now seen corresponding path program 1 times [2024-11-28 03:19:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:19:59,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425105400] [2024-11-28 03:19:59,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:19:59,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:19:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:19:59,983 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-28 03:19:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:19:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425105400] [2024-11-28 03:19:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425105400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:19:59,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:19:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:19:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66949016] [2024-11-28 03:19:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:19:59,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:19:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:19:59,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:19:59,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:19:59,984 INFO L87 Difference]: Start difference. First operand 1709 states and 2410 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:00,938 INFO L93 Difference]: Finished difference Result 2004 states and 2756 transitions. [2024-11-28 03:20:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:00,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-28 03:20:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:00,947 INFO L225 Difference]: With dead ends: 2004 [2024-11-28 03:20:00,948 INFO L226 Difference]: Without dead ends: 2004 [2024-11-28 03:20:00,948 INFO L434 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-28 03:20:00,950 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 864 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:00,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1669 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:20:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-28 03:20:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1684. [2024-11-28 03:20:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1352 states have (on average 1.738905325443787) internal successors, (2351), 1677 states have internal predecessors, (2351), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2361 transitions. [2024-11-28 03:20:01,003 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2361 transitions. Word has length 10 [2024-11-28 03:20:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:01,004 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2361 transitions. [2024-11-28 03:20:01,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2361 transitions. [2024-11-28 03:20:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:20:01,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:01,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:01,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:20:01,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -564898849, now seen corresponding path program 1 times [2024-11-28 03:20:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916059288] [2024-11-28 03:20:01,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916059288] [2024-11-28 03:20:01,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916059288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:01,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:01,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:01,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173613445] [2024-11-28 03:20:01,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:01,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:01,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:01,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:01,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:01,181 INFO L87 Difference]: Start difference. First operand 1684 states and 2361 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:02,099 INFO L93 Difference]: Finished difference Result 1808 states and 2520 transitions. [2024-11-28 03:20:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:20:02,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-28 03:20:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:02,108 INFO L225 Difference]: With dead ends: 1808 [2024-11-28 03:20:02,108 INFO L226 Difference]: Without dead ends: 1808 [2024-11-28 03:20:02,108 INFO L434 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-28 03:20:02,109 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 1287 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:02,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1402 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:20:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-28 03:20:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1661. [2024-11-28 03:20:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1352 states have (on average 1.6878698224852071) internal successors, (2282), 1654 states have internal predecessors, (2282), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2292 transitions. [2024-11-28 03:20:02,159 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2292 transitions. Word has length 14 [2024-11-28 03:20:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:02,160 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2292 transitions. [2024-11-28 03:20:02,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2292 transitions. [2024-11-28 03:20:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:20:02,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:02,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:20:02,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:02,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -564898848, now seen corresponding path program 1 times [2024-11-28 03:20:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:02,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036058118] [2024-11-28 03:20:02,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:02,437 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-28 03:20:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:02,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036058118] [2024-11-28 03:20:02,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036058118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533478867] [2024-11-28 03:20:02,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:02,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:02,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:02,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:02,440 INFO L87 Difference]: Start difference. First operand 1661 states and 2292 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:03,932 INFO L93 Difference]: Finished difference Result 2162 states and 2775 transitions. [2024-11-28 03:20:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:20:03,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-28 03:20:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:03,942 INFO L225 Difference]: With dead ends: 2162 [2024-11-28 03:20:03,942 INFO L226 Difference]: Without dead ends: 2162 [2024-11-28 03:20:03,942 INFO L434 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-28 03:20:03,945 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1278 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:03,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2255 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:20:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2024-11-28 03:20:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1757. [2024-11-28 03:20:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1448 states have (on average 1.6685082872928176) internal successors, (2416), 1750 states have internal predecessors, (2416), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2426 transitions. [2024-11-28 03:20:03,997 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2426 transitions. Word has length 14 [2024-11-28 03:20:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:03,998 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2426 transitions. [2024-11-28 03:20:03,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2426 transitions. [2024-11-28 03:20:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:20:04,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:04,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:04,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:20:04,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1701595783, now seen corresponding path program 1 times [2024-11-28 03:20:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375601821] [2024-11-28 03:20:04,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:04,144 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-28 03:20:04,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:04,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375601821] [2024-11-28 03:20:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375601821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:04,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:04,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:04,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205051115] [2024-11-28 03:20:04,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:04,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:04,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:04,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:04,146 INFO L87 Difference]: Start difference. First operand 1757 states and 2426 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:04,241 INFO L93 Difference]: Finished difference Result 1429 states and 1909 transitions. [2024-11-28 03:20:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 03:20:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:04,247 INFO L225 Difference]: With dead ends: 1429 [2024-11-28 03:20:04,247 INFO L226 Difference]: Without dead ends: 1429 [2024-11-28 03:20:04,248 INFO L434 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-28 03:20:04,248 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 45 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:04,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2812 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-28 03:20:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2024-11-28 03:20:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1139 states have (on average 1.6672519754170325) internal successors, (1899), 1422 states have internal predecessors, (1899), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1909 transitions. [2024-11-28 03:20:04,285 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1909 transitions. Word has length 16 [2024-11-28 03:20:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:04,285 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1909 transitions. [2024-11-28 03:20:04,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1909 transitions. [2024-11-28 03:20:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:20:04,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:04,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:20:04,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969666, now seen corresponding path program 1 times [2024-11-28 03:20:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754865401] [2024-11-28 03:20:04,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:04,472 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-28 03:20:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754865401] [2024-11-28 03:20:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754865401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084150713] [2024-11-28 03:20:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:04,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:04,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:04,474 INFO L87 Difference]: Start difference. First operand 1429 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:04,513 INFO L93 Difference]: Finished difference Result 1279 states and 1679 transitions. [2024-11-28 03:20:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 03:20:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:04,519 INFO L225 Difference]: With dead ends: 1279 [2024-11-28 03:20:04,519 INFO L226 Difference]: Without dead ends: 1279 [2024-11-28 03:20:04,519 INFO L434 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-28 03:20:04,520 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 71 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1617 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-28 03:20:04,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1617 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:20:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-28 03:20:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2024-11-28 03:20:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1013 states have (on average 1.6475814412635736) internal successors, (1669), 1272 states have internal predecessors, (1669), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1679 transitions. [2024-11-28 03:20:04,553 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1679 transitions. Word has length 20 [2024-11-28 03:20:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:04,553 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1679 transitions. [2024-11-28 03:20:04,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1679 transitions. [2024-11-28 03:20:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:20:04,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:04,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:20:04,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:04,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash 5595258, now seen corresponding path program 1 times [2024-11-28 03:20:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395450397] [2024-11-28 03:20:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:04,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-28 03:20:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395450397] [2024-11-28 03:20:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395450397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:04,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:04,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231278539] [2024-11-28 03:20:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:04,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:04,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:04,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:04,678 INFO L87 Difference]: Start difference. First operand 1279 states and 1679 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:04,767 INFO L93 Difference]: Finished difference Result 1249 states and 1621 transitions. [2024-11-28 03:20:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:04,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-28 03:20:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:04,778 INFO L225 Difference]: With dead ends: 1249 [2024-11-28 03:20:04,779 INFO L226 Difference]: Without dead ends: 1249 [2024-11-28 03:20:04,779 INFO L434 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-28 03:20:04,780 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 48 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2359 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-28 03:20:04,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2359 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-28 03:20:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-11-28 03:20:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 997 states have (on average 1.6158475426278835) internal successors, (1611), 1242 states have internal predecessors, (1611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1621 transitions. [2024-11-28 03:20:04,815 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1621 transitions. Word has length 22 [2024-11-28 03:20:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:04,815 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1621 transitions. [2024-11-28 03:20:04,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1621 transitions. [2024-11-28 03:20:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:20:04,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:04,816 INFO L218 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] [2024-11-28 03:20:04,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:20:04,816 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467048, now seen corresponding path program 1 times [2024-11-28 03:20:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857868564] [2024-11-28 03:20:04,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:04,957 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-28 03:20:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857868564] [2024-11-28 03:20:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857868564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348365786] [2024-11-28 03:20:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:04,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:04,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:04,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:04,960 INFO L87 Difference]: Start difference. First operand 1249 states and 1621 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:05,747 INFO L93 Difference]: Finished difference Result 1383 states and 1768 transitions. [2024-11-28 03:20:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:20:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-28 03:20:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:05,753 INFO L225 Difference]: With dead ends: 1383 [2024-11-28 03:20:05,753 INFO L226 Difference]: Without dead ends: 1383 [2024-11-28 03:20:05,753 INFO L434 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-28 03:20:05,754 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 925 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:05,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1566 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:20:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-28 03:20:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1245. [2024-11-28 03:20:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 997 states have (on average 1.6078234704112337) internal successors, (1603), 1238 states have internal predecessors, (1603), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1613 transitions. [2024-11-28 03:20:05,788 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1613 transitions. Word has length 36 [2024-11-28 03:20:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:05,789 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1613 transitions. [2024-11-28 03:20:05,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1613 transitions. [2024-11-28 03:20:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:20:05,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:05,792 INFO L218 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] [2024-11-28 03:20:05,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:20:05,792 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:05,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467049, now seen corresponding path program 1 times [2024-11-28 03:20:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255754331] [2024-11-28 03:20:05,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:06,096 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-28 03:20:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255754331] [2024-11-28 03:20:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255754331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:06,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157224395] [2024-11-28 03:20:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:06,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:06,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:06,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:06,099 INFO L87 Difference]: Start difference. First operand 1245 states and 1613 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:07,090 INFO L93 Difference]: Finished difference Result 1829 states and 2411 transitions. [2024-11-28 03:20:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:20:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-28 03:20:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:07,098 INFO L225 Difference]: With dead ends: 1829 [2024-11-28 03:20:07,098 INFO L226 Difference]: Without dead ends: 1829 [2024-11-28 03:20:07,098 INFO L434 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-28 03:20:07,099 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 659 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:07,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1910 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:20:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-28 03:20:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1241. [2024-11-28 03:20:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 997 states have (on average 1.5997993981945837) internal successors, (1595), 1234 states have internal predecessors, (1595), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1605 transitions. [2024-11-28 03:20:07,132 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1605 transitions. Word has length 36 [2024-11-28 03:20:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1605 transitions. [2024-11-28 03:20:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1605 transitions. [2024-11-28 03:20:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:20:07,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:07,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:07,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:20:07,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1978501923, now seen corresponding path program 1 times [2024-11-28 03:20:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380293991] [2024-11-28 03:20:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:07,337 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-28 03:20:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380293991] [2024-11-28 03:20:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380293991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:07,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295933943] [2024-11-28 03:20:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:07,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:07,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:07,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:07,343 INFO L87 Difference]: Start difference. First operand 1241 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:07,410 INFO L93 Difference]: Finished difference Result 1223 states and 1575 transitions. [2024-11-28 03:20:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:07,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-28 03:20:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:07,415 INFO L225 Difference]: With dead ends: 1223 [2024-11-28 03:20:07,415 INFO L226 Difference]: Without dead ends: 1223 [2024-11-28 03:20:07,415 INFO L434 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-28 03:20:07,416 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 27 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:07,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2330 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:20:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-28 03:20:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2024-11-28 03:20:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 979 states have (on average 1.5985699693564863) internal successors, (1565), 1216 states have internal predecessors, (1565), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1575 transitions. [2024-11-28 03:20:07,443 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1575 transitions. Word has length 62 [2024-11-28 03:20:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:07,443 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1575 transitions. [2024-11-28 03:20:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1575 transitions. [2024-11-28 03:20:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:20:07,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:07,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:07,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:20:07,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -12119383, now seen corresponding path program 1 times [2024-11-28 03:20:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:07,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209442720] [2024-11-28 03:20:07,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:07,594 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-28 03:20:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209442720] [2024-11-28 03:20:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209442720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:07,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:07,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389510073] [2024-11-28 03:20:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:07,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:07,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:07,597 INFO L87 Difference]: Start difference. First operand 1223 states and 1575 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:07,677 INFO L93 Difference]: Finished difference Result 1495 states and 1889 transitions. [2024-11-28 03:20:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 03:20:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:07,683 INFO L225 Difference]: With dead ends: 1495 [2024-11-28 03:20:07,683 INFO L226 Difference]: Without dead ends: 1495 [2024-11-28 03:20:07,684 INFO L434 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-28 03:20:07,684 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 206 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:07,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1569 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-28 03:20:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1482. [2024-11-28 03:20:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1238 states have (on average 1.5145395799676897) internal successors, (1875), 1475 states have internal predecessors, (1875), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1885 transitions. [2024-11-28 03:20:07,715 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1885 transitions. Word has length 70 [2024-11-28 03:20:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:07,715 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1885 transitions. [2024-11-28 03:20:07,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1885 transitions. [2024-11-28 03:20:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 03:20:07,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:07,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:07,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:20:07,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:07,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:07,719 INFO L85 PathProgramCache]: Analyzing trace with hash 836446931, now seen corresponding path program 1 times [2024-11-28 03:20:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:07,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040976661] [2024-11-28 03:20:07,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:07,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:08,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040976661] [2024-11-28 03:20:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040976661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:20:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196536761] [2024-11-28 03:20:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:08,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:20:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:08,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:20:08,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:08,417 INFO L87 Difference]: Start difference. First operand 1482 states and 1885 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:08,699 INFO L93 Difference]: Finished difference Result 2102 states and 2618 transitions. [2024-11-28 03:20:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-28 03:20:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:08,707 INFO L225 Difference]: With dead ends: 2102 [2024-11-28 03:20:08,708 INFO L226 Difference]: Without dead ends: 2099 [2024-11-28 03:20:08,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:20:08,709 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 734 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:08,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 4507 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:20:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-28 03:20:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1383. [2024-11-28 03:20:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1139 states have (on average 1.533801580333626) internal successors, (1747), 1376 states have internal predecessors, (1747), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1757 transitions. [2024-11-28 03:20:08,754 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1757 transitions. Word has length 76 [2024-11-28 03:20:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:08,754 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1757 transitions. [2024-11-28 03:20:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1757 transitions. [2024-11-28 03:20:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 03:20:08,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:08,756 INFO L218 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] [2024-11-28 03:20:08,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:20:08,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 5623378, now seen corresponding path program 1 times [2024-11-28 03:20:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957386054] [2024-11-28 03:20:08,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:08,983 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-28 03:20:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957386054] [2024-11-28 03:20:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957386054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216256340] [2024-11-28 03:20:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:08,986 INFO L87 Difference]: Start difference. First operand 1383 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:09,059 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2024-11-28 03:20:09,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-28 03:20:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:09,065 INFO L225 Difference]: With dead ends: 1365 [2024-11-28 03:20:09,065 INFO L226 Difference]: Without dead ends: 1365 [2024-11-28 03:20:09,066 INFO L434 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-28 03:20:09,066 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 21 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2324 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-28 03:20:09,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2324 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:20:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-11-28 03:20:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2024-11-28 03:20:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1121 states have (on average 1.5316681534344336) internal successors, (1717), 1358 states have internal predecessors, (1717), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1727 transitions. [2024-11-28 03:20:09,101 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1727 transitions. Word has length 78 [2024-11-28 03:20:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:09,102 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1727 transitions. [2024-11-28 03:20:09,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1727 transitions. [2024-11-28 03:20:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 03:20:09,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:09,103 INFO L218 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-28 03:20:09,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:20:09,104 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash -18190178, now seen corresponding path program 1 times [2024-11-28 03:20:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:09,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113481721] [2024-11-28 03:20:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:09,517 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-28 03:20:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113481721] [2024-11-28 03:20:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113481721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:09,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:09,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007758033] [2024-11-28 03:20:09,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:09,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:20:09,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:09,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:20:09,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:20:09,520 INFO L87 Difference]: Start difference. First operand 1365 states and 1727 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:10,498 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2024-11-28 03:20:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:10,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-28 03:20:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:10,504 INFO L225 Difference]: With dead ends: 1364 [2024-11-28 03:20:10,504 INFO L226 Difference]: Without dead ends: 1364 [2024-11-28 03:20:10,505 INFO L434 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-28 03:20:10,505 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:10,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2331 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:20:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-11-28 03:20:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2024-11-28 03:20:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1121 states have (on average 1.5298840321141838) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1725 transitions. [2024-11-28 03:20:10,531 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1725 transitions. Word has length 86 [2024-11-28 03:20:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:10,531 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1725 transitions. [2024-11-28 03:20:10,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1725 transitions. [2024-11-28 03:20:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 03:20:10,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:10,533 INFO L218 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-28 03:20:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:20:10,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:10,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -18190177, now seen corresponding path program 1 times [2024-11-28 03:20:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080745820] [2024-11-28 03:20:10,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:11,225 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-28 03:20:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:11,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080745820] [2024-11-28 03:20:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080745820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:11,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:11,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766557860] [2024-11-28 03:20:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:11,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:20:11,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:11,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:20:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:20:11,228 INFO L87 Difference]: Start difference. First operand 1364 states and 1725 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:12,326 INFO L93 Difference]: Finished difference Result 1363 states and 1723 transitions. [2024-11-28 03:20:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-28 03:20:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:12,332 INFO L225 Difference]: With dead ends: 1363 [2024-11-28 03:20:12,332 INFO L226 Difference]: Without dead ends: 1363 [2024-11-28 03:20:12,332 INFO L434 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-28 03:20:12,333 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 1 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:12,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2257 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:20:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2024-11-28 03:20:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2024-11-28 03:20:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1356 states have internal predecessors, (1713), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2024-11-28 03:20:12,360 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 86 [2024-11-28 03:20:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:12,360 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2024-11-28 03:20:12,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2024-11-28 03:20:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 03:20:12,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:12,362 INFO L218 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-28 03:20:12,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:20:12,362 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:12,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1418734117, now seen corresponding path program 1 times [2024-11-28 03:20:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452168821] [2024-11-28 03:20:12,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:12,761 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-28 03:20:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452168821] [2024-11-28 03:20:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452168821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:20:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389995822] [2024-11-28 03:20:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:20:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:12,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:20:12,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:12,765 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-28 03:20:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:13,772 INFO L93 Difference]: Finished difference Result 1381 states and 1749 transitions. [2024-11-28 03:20:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:20:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-28 03:20:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:13,780 INFO L225 Difference]: With dead ends: 1381 [2024-11-28 03:20:13,780 INFO L226 Difference]: Without dead ends: 1381 [2024-11-28 03:20:13,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:20:13,781 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 6 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:13,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3128 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:20:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-28 03:20:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1372. [2024-11-28 03:20:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5297249334516416) internal successors, (1724), 1363 states have internal predecessors, (1724), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-28 03:20:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1739 transitions. [2024-11-28 03:20:13,821 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1739 transitions. Word has length 94 [2024-11-28 03:20:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:13,821 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1739 transitions. [2024-11-28 03:20:13,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-28 03:20:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1739 transitions. [2024-11-28 03:20:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 03:20:13,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:13,822 INFO L218 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-28 03:20:13,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:20:13,823 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1418734118, now seen corresponding path program 1 times [2024-11-28 03:20:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81256625] [2024-11-28 03:20:13,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:14,627 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-28 03:20:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81256625] [2024-11-28 03:20:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81256625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:14,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:20:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532218140] [2024-11-28 03:20:14,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:20:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:14,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:20:14,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:14,631 INFO L87 Difference]: Start difference. First operand 1372 states and 1739 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 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-28 03:20:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:15,866 INFO L93 Difference]: Finished difference Result 1372 states and 1737 transitions. [2024-11-28 03:20:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 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-28 03:20:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:15,872 INFO L225 Difference]: With dead ends: 1372 [2024-11-28 03:20:15,872 INFO L226 Difference]: Without dead ends: 1372 [2024-11-28 03:20:15,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:15,874 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:15,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2929 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:20:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-28 03:20:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-11-28 03:20:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5279503105590062) internal successors, (1722), 1363 states have internal predecessors, (1722), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-28 03:20:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1737 transitions. [2024-11-28 03:20:15,917 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1737 transitions. Word has length 94 [2024-11-28 03:20:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:15,917 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1737 transitions. [2024-11-28 03:20:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 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-28 03:20:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1737 transitions. [2024-11-28 03:20:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 03:20:15,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:15,918 INFO L218 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-28 03:20:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:20:15,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:15,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1624609176, now seen corresponding path program 1 times [2024-11-28 03:20:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695276804] [2024-11-28 03:20:15,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:16,780 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-28 03:20:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695276804] [2024-11-28 03:20:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695276804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904112625] [2024-11-28 03:20:16,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:16,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:16,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:16,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:16,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:20:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:17,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 03:20:17,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:17,181 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-28 03:20:17,419 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:20:17,420 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-28 03:20:17,486 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-28 03:20:17,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:20:17,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:17,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:17,953 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-28 03:20:18,005 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-28 03:20:18,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904112625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:18,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:20:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-28 03:20:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009516099] [2024-11-28 03:20:18,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:20:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:18,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:20:18,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2024-11-28 03:20:18,106 INFO L87 Difference]: Start difference. First operand 1372 states and 1737 transitions. Second operand has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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-28 03:20:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:21,304 INFO L93 Difference]: Finished difference Result 1379 states and 1743 transitions. [2024-11-28 03:20:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:20:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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-28 03:20:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:21,309 INFO L225 Difference]: With dead ends: 1379 [2024-11-28 03:20:21,309 INFO L226 Difference]: Without dead ends: 1379 [2024-11-28 03:20:21,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2024-11-28 03:20:21,311 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 710 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:21,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 5369 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 03:20:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-28 03:20:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2024-11-28 03:20:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1131 states have (on average 1.5251989389920424) internal successors, (1725), 1366 states have internal predecessors, (1725), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1737 transitions. [2024-11-28 03:20:21,343 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1737 transitions. Word has length 95 [2024-11-28 03:20:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:21,344 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1737 transitions. [2024-11-28 03:20:21,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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-28 03:20:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1737 transitions. [2024-11-28 03:20:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 03:20:21,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:21,349 INFO L218 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-28 03:20:21,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:20:21,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 03:20:21,553 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:21,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1624609177, now seen corresponding path program 1 times [2024-11-28 03:20:21,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652060557] [2024-11-28 03:20:21,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:22,667 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-28 03:20:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652060557] [2024-11-28 03:20:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652060557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:22,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469558846] [2024-11-28 03:20:22,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:22,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:22,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:20:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:23,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 03:20:23,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:23,028 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-28 03:20:23,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:23,206 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-28 03:20:23,217 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-28 03:20:23,263 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-28 03:20:23,268 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-28 03:20:23,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:20:23,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:20:23,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:23,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:23,591 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-28 03:20:23,648 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-28 03:20:23,655 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-28 03:20:23,685 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-28 03:20:23,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469558846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:23,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:20:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 03:20:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160139896] [2024-11-28 03:20:23,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:23,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:20:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:23,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:20:23,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=347, Unknown=12, NotChecked=0, Total=420 [2024-11-28 03:20:23,920 INFO L87 Difference]: Start difference. First operand 1376 states and 1737 transitions. Second operand has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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-28 03:20:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:27,685 INFO L93 Difference]: Finished difference Result 1378 states and 1741 transitions. [2024-11-28 03:20:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:20:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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-28 03:20:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:27,694 INFO L225 Difference]: With dead ends: 1378 [2024-11-28 03:20:27,694 INFO L226 Difference]: Without dead ends: 1378 [2024-11-28 03:20:27,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=492, Unknown=13, NotChecked=0, Total=600 [2024-11-28 03:20:27,696 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 704 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 4587 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 4981 SdHoareTripleChecker+Invalid, 4607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:27,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 4981 Invalid, 4607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4587 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:20:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-28 03:20:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1366. [2024-11-28 03:20:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1123 states have (on average 1.5262689225289403) internal successors, (1714), 1358 states have internal predecessors, (1714), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1724 transitions. [2024-11-28 03:20:27,726 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1724 transitions. Word has length 95 [2024-11-28 03:20:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:27,726 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1724 transitions. [2024-11-28 03:20:27,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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-28 03:20:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1724 transitions. [2024-11-28 03:20:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 03:20:27,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:27,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:27,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:20:27,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 03:20:27,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:27,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1264437883, now seen corresponding path program 1 times [2024-11-28 03:20:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041843023] [2024-11-28 03:20:27,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:28,692 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-28 03:20:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041843023] [2024-11-28 03:20:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041843023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:20:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459730211] [2024-11-28 03:20:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:28,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:20:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:28,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:20:28,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:20:28,695 INFO L87 Difference]: Start difference. First operand 1366 states and 1724 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-28 03:20:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:30,531 INFO L93 Difference]: Finished difference Result 1385 states and 1749 transitions. [2024-11-28 03:20:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:20:30,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-28 03:20:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:30,539 INFO L225 Difference]: With dead ends: 1385 [2024-11-28 03:20:30,539 INFO L226 Difference]: Without dead ends: 1385 [2024-11-28 03:20:30,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 03:20:30,541 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 738 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:30,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3938 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 03:20:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-28 03:20:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1381. [2024-11-28 03:20:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5224274406332454) internal successors, (1731), 1371 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1743 transitions. [2024-11-28 03:20:30,617 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1743 transitions. Word has length 97 [2024-11-28 03:20:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:30,618 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1743 transitions. [2024-11-28 03:20:30,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-28 03:20:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1743 transitions. [2024-11-28 03:20:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 03:20:30,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:30,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:20:30,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1264437882, now seen corresponding path program 1 times [2024-11-28 03:20:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313835798] [2024-11-28 03:20:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:31,662 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-28 03:20:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313835798] [2024-11-28 03:20:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313835798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:20:31,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310746568] [2024-11-28 03:20:31,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:20:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:31,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:20:31,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:20:31,664 INFO L87 Difference]: Start difference. First operand 1381 states and 1743 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-28 03:20:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:33,475 INFO L93 Difference]: Finished difference Result 1384 states and 1747 transitions. [2024-11-28 03:20:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:20:33,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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 97 [2024-11-28 03:20:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:33,477 INFO L225 Difference]: With dead ends: 1384 [2024-11-28 03:20:33,477 INFO L226 Difference]: Without dead ends: 1384 [2024-11-28 03:20:33,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:20:33,478 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 714 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:33,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 3001 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 03:20:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-28 03:20:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-28 03:20:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5206684256816183) internal successors, (1729), 1371 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1741 transitions. [2024-11-28 03:20:33,501 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1741 transitions. Word has length 97 [2024-11-28 03:20:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:33,502 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1741 transitions. [2024-11-28 03:20:33,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-28 03:20:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1741 transitions. [2024-11-28 03:20:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 03:20:33,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:33,505 INFO L218 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-28 03:20:33,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:20:33,506 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1253853902, now seen corresponding path program 1 times [2024-11-28 03:20:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594855321] [2024-11-28 03:20:33,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:34,316 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-28 03:20:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594855321] [2024-11-28 03:20:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594855321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267659026] [2024-11-28 03:20:34,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:34,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:34,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:34,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:34,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:20:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:34,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:20:34,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:34,697 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-28 03:20:34,920 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:20:34,920 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-28 03:20:34,977 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-28 03:20:35,115 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-28 03:20:35,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:35,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:35,465 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:35,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:35,489 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-28 03:20:35,538 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-28 03:20:35,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:35,699 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (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_1066))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:20:35,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267659026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:35,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:20:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-28 03:20:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993533845] [2024-11-28 03:20:35,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:35,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:20:35,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:35,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:20:35,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=456, Unknown=18, NotChecked=44, Total=600 [2024-11-28 03:20:35,703 INFO L87 Difference]: Start difference. First operand 1381 states and 1741 transitions. Second operand has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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-28 03:20:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:39,308 INFO L93 Difference]: Finished difference Result 1383 states and 1745 transitions. [2024-11-28 03:20:39,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:20:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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 98 [2024-11-28 03:20:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:39,311 INFO L225 Difference]: With dead ends: 1383 [2024-11-28 03:20:39,311 INFO L226 Difference]: Without dead ends: 1383 [2024-11-28 03:20:39,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=583, Unknown=19, NotChecked=50, Total=756 [2024-11-28 03:20:39,312 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 693 mSDsluCounter, 6353 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 6854 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:39,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 6854 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 03:20:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-28 03:20:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-11-28 03:20:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1137 states have (on average 1.5189094107299912) internal successors, (1727), 1370 states have internal predecessors, (1727), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1739 transitions. [2024-11-28 03:20:39,334 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1739 transitions. Word has length 98 [2024-11-28 03:20:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:39,334 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1739 transitions. [2024-11-28 03:20:39,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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-28 03:20:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1739 transitions. [2024-11-28 03:20:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 03:20:39,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:39,336 INFO L218 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-28 03:20:39,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:20:39,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:39,541 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:39,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1253853901, now seen corresponding path program 1 times [2024-11-28 03:20:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474015726] [2024-11-28 03:20:39,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:40,637 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-28 03:20:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474015726] [2024-11-28 03:20:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474015726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098366259] [2024-11-28 03:20:40,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:40,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:40,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:20:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:40,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 03:20:40,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:40,997 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-28 03:20:41,156 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-28 03:20:41,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:41,170 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-28 03:20:41,184 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-28 03:20:41,198 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-28 03:20:41,291 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-28 03:20:41,297 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-28 03:20:41,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:41,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:41,463 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-28 03:20:41,555 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:41,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:41,569 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-28 03:20:41,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:20:41,600 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-28 03:20:41,606 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-28 03:20:41,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:41,750 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_1218 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:20:41,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 03:20:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098366259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:41,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:20:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-11-28 03:20:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532003415] [2024-11-28 03:20:41,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:41,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:20:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:41,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:20:41,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=8, NotChecked=74, Total=462 [2024-11-28 03:20:41,831 INFO L87 Difference]: Start difference. First operand 1380 states and 1739 transitions. Second operand has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:20:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:45,583 INFO L93 Difference]: Finished difference Result 1382 states and 1743 transitions. [2024-11-28 03:20:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:20:45,587 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-28 03:20:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:45,592 INFO L225 Difference]: With dead ends: 1382 [2024-11-28 03:20:45,592 INFO L226 Difference]: Without dead ends: 1382 [2024-11-28 03:20:45,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=493, Unknown=10, NotChecked=94, Total=702 [2024-11-28 03:20:45,593 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 698 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 4400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:45,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 5078 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4400 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:20:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-28 03:20:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1364. [2024-11-28 03:20:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1123 states have (on average 1.522707034728406) internal successors, (1710), 1356 states have internal predecessors, (1710), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:20:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1720 transitions. [2024-11-28 03:20:45,620 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1720 transitions. Word has length 98 [2024-11-28 03:20:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:45,621 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1720 transitions. [2024-11-28 03:20:45,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:20:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1720 transitions. [2024-11-28 03:20:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:20:45,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:45,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:45,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:20:45,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 03:20:45,827 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:45,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2005137076, now seen corresponding path program 1 times [2024-11-28 03:20:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:45,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716802289] [2024-11-28 03:20:45,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:46,611 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-28 03:20:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:46,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716802289] [2024-11-28 03:20:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716802289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:20:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967710682] [2024-11-28 03:20:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:46,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:20:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:46,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:20:46,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:20:46,614 INFO L87 Difference]: Start difference. First operand 1364 states and 1720 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-28 03:20:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:48,629 INFO L93 Difference]: Finished difference Result 1389 states and 1751 transitions. [2024-11-28 03:20:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:20:48,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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 100 [2024-11-28 03:20:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:48,632 INFO L225 Difference]: With dead ends: 1389 [2024-11-28 03:20:48,633 INFO L226 Difference]: Without dead ends: 1389 [2024-11-28 03:20:48,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 03:20:48,633 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 741 mSDsluCounter, 3431 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3932 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:48,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3932 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 03:20:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-28 03:20:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1385. [2024-11-28 03:20:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5161854768153982) internal successors, (1733), 1375 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1745 transitions. [2024-11-28 03:20:48,648 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1745 transitions. Word has length 100 [2024-11-28 03:20:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:48,649 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1745 transitions. [2024-11-28 03:20:48,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-28 03:20:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1745 transitions. [2024-11-28 03:20:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:20:48,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:48,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:48,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:20:48,650 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2005137075, now seen corresponding path program 1 times [2024-11-28 03:20:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:48,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272130571] [2024-11-28 03:20:48,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:49,691 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-28 03:20:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272130571] [2024-11-28 03:20:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272130571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:49,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:49,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:20:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770232171] [2024-11-28 03:20:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:49,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:20:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:49,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:20:49,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:20:49,694 INFO L87 Difference]: Start difference. First operand 1385 states and 1745 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-28 03:20:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:52,387 INFO L93 Difference]: Finished difference Result 1388 states and 1749 transitions. [2024-11-28 03:20:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:20:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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 100 [2024-11-28 03:20:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:52,391 INFO L225 Difference]: With dead ends: 1388 [2024-11-28 03:20:52,391 INFO L226 Difference]: Without dead ends: 1388 [2024-11-28 03:20:52,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:20:52,392 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 716 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:52,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3838 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 03:20:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-28 03:20:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-28 03:20:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5144356955380578) internal successors, (1731), 1375 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1743 transitions. [2024-11-28 03:20:52,411 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1743 transitions. Word has length 100 [2024-11-28 03:20:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1743 transitions. [2024-11-28 03:20:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-28 03:20:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1743 transitions. [2024-11-28 03:20:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 03:20:52,412 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:52,412 INFO L218 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-28 03:20:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:20:52,413 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -230371713, now seen corresponding path program 1 times [2024-11-28 03:20:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:52,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451646692] [2024-11-28 03:20:52,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:53,177 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-28 03:20:53,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:53,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451646692] [2024-11-28 03:20:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451646692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:53,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966960687] [2024-11-28 03:20:53,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:53,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:53,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:53,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:20:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:53,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 03:20:53,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:53,525 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-28 03:20:53,677 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:20:53,678 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-28 03:20:53,719 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-28 03:20:53,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:20:54,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:54,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:54,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:54,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:20:54,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:20:54,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:20:54,301 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-28 03:20:54,383 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-28 03:20:54,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:20:54,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 03:20:54,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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~mem56#1.base| v_ArrVal_1529))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:20:54,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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_1529))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:20:54,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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~mem54#1.base| v_ArrVal_1533))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1529)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:20:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966960687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:54,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:20:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-28 03:20:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491512897] [2024-11-28 03:20:54,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:20:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:20:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:54,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:20:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=506, Unknown=11, NotChecked=196, Total=812 [2024-11-28 03:20:54,524 INFO L87 Difference]: Start difference. First operand 1385 states and 1743 transitions. Second operand has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 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-28 03:20:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:20:57,859 INFO L93 Difference]: Finished difference Result 1387 states and 1747 transitions. [2024-11-28 03:20:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:20:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 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 101 [2024-11-28 03:20:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:20:57,864 INFO L225 Difference]: With dead ends: 1387 [2024-11-28 03:20:57,864 INFO L226 Difference]: Without dead ends: 1387 [2024-11-28 03:20:57,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=640, Unknown=11, NotChecked=220, Total=992 [2024-11-28 03:20:57,865 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 690 mSDsluCounter, 6327 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 6827 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:20:57,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 6827 Invalid, 4330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 03:20:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-28 03:20:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1384. [2024-11-28 03:20:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1143 states have (on average 1.5126859142607174) internal successors, (1729), 1374 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:20:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1741 transitions. [2024-11-28 03:20:57,886 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1741 transitions. Word has length 101 [2024-11-28 03:20:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:20:57,886 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1741 transitions. [2024-11-28 03:20:57,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 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-28 03:20:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1741 transitions. [2024-11-28 03:20:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 03:20:57,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:20:57,888 INFO L218 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-28 03:20:57,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:20:58,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 03:20:58,088 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:20:58,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -230371712, now seen corresponding path program 1 times [2024-11-28 03:20:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:58,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857133820] [2024-11-28 03:20:58,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:59,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-28 03:20:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857133820] [2024-11-28 03:20:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857133820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:20:59,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826583678] [2024-11-28 03:20:59,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:59,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:20:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:59,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:20:59,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:20:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:59,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 03:20:59,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:20:59,796 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-28 03:20:59,936 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-28 03:20:59,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:20:59,947 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-28 03:20:59,978 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-28 03:20:59,982 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-28 03:21:00,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:21:00,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:21:00,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:21:00,255 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-28 03:21:00,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:00,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:00,348 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-28 03:21:00,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:00,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:00,427 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-28 03:21:00,449 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-28 03:21:00,455 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-28 03:21:00,458 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-28 03:21:00,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:00,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1698 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-28 03:21:00,567 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_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1698 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 03:21:00,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1697))) (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~mem56#1.base| v_ArrVal_1696) .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:21:00,615 WARN L851 $PredicateComparison]: unable to prove that (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))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1697))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1696) .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-28 03:21:00,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1705))) (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~mem54#1.base| v_ArrVal_1704) .cse0 v_ArrVal_1696) (select (select (store .cse1 .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1698))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1705))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1697))) (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~mem54#1.base| v_ArrVal_1704) .cse3 v_ArrVal_1696) .cse4 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:21:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826583678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:00,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:21:00,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2024-11-28 03:21:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579657179] [2024-11-28 03:21:00,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:00,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:21:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:00,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:21:00,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=355, Unknown=5, NotChecked=210, Total=650 [2024-11-28 03:21:00,701 INFO L87 Difference]: Start difference. First operand 1384 states and 1741 transitions. Second operand has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:21:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:04,539 INFO L93 Difference]: Finished difference Result 1386 states and 1745 transitions. [2024-11-28 03:21:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:21:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-11-28 03:21:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:04,544 INFO L225 Difference]: With dead ends: 1386 [2024-11-28 03:21:04,544 INFO L226 Difference]: Without dead ends: 1386 [2024-11-28 03:21:04,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=591, Unknown=5, NotChecked=270, Total=992 [2024-11-28 03:21:04,545 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 699 mSDsluCounter, 4579 mSDsCounter, 0 mSdLazyCounter, 4401 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:04,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 5082 Invalid, 4414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4401 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 03:21:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-28 03:21:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1362. [2024-11-28 03:21:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1123 states have (on average 1.5191451469278718) internal successors, (1706), 1354 states have internal predecessors, (1706), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:21:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1716 transitions. [2024-11-28 03:21:04,564 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1716 transitions. Word has length 101 [2024-11-28 03:21:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:04,565 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1716 transitions. [2024-11-28 03:21:04,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:21:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1716 transitions. [2024-11-28 03:21:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 03:21:04,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:04,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:04,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:04,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:04,771 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:04,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash -632821940, now seen corresponding path program 1 times [2024-11-28 03:21:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600865440] [2024-11-28 03:21:04,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:05,356 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-28 03:21:05,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600865440] [2024-11-28 03:21:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600865440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:05,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:21:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833511292] [2024-11-28 03:21:05,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:21:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:05,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:21:05,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:21:05,358 INFO L87 Difference]: Start difference. First operand 1362 states and 1716 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:21:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:07,488 INFO L93 Difference]: Finished difference Result 1393 states and 1753 transitions. [2024-11-28 03:21:07,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:21:07,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 03:21:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:07,491 INFO L225 Difference]: With dead ends: 1393 [2024-11-28 03:21:07,492 INFO L226 Difference]: Without dead ends: 1393 [2024-11-28 03:21:07,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:21:07,493 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 741 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 4920 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:07,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 4920 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 03:21:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-28 03:21:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1389. [2024-11-28 03:21:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5100087032201914) internal successors, (1735), 1379 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:21:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1747 transitions. [2024-11-28 03:21:07,512 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1747 transitions. Word has length 103 [2024-11-28 03:21:07,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1747 transitions. [2024-11-28 03:21:07,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:21:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1747 transitions. [2024-11-28 03:21:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 03:21:07,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:07,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 03:21:07,515 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -632821939, now seen corresponding path program 1 times [2024-11-28 03:21:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259070122] [2024-11-28 03:21:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:08,843 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-28 03:21:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259070122] [2024-11-28 03:21:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259070122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:21:08,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968895042] [2024-11-28 03:21:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:08,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:21:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:08,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:21:08,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:21:08,847 INFO L87 Difference]: Start difference. First operand 1389 states and 1747 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:21:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:10,946 INFO L93 Difference]: Finished difference Result 1392 states and 1751 transitions. [2024-11-28 03:21:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:21:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 03:21:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:10,949 INFO L225 Difference]: With dead ends: 1392 [2024-11-28 03:21:10,949 INFO L226 Difference]: Without dead ends: 1392 [2024-11-28 03:21:10,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:21:10,950 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 734 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:10,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 3007 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 03:21:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-28 03:21:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1389. [2024-11-28 03:21:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5082680591818973) internal successors, (1733), 1379 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:21:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1745 transitions. [2024-11-28 03:21:10,970 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1745 transitions. Word has length 103 [2024-11-28 03:21:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:10,971 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1745 transitions. [2024-11-28 03:21:10,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:21:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1745 transitions. [2024-11-28 03:21:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 03:21:10,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:10,972 INFO L218 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-28 03:21:10,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 03:21:10,973 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 354693433, now seen corresponding path program 1 times [2024-11-28 03:21:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736256339] [2024-11-28 03:21:10,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:11,927 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-28 03:21:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736256339] [2024-11-28 03:21:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736256339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768858829] [2024-11-28 03:21:11,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:11,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:11,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:11,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:21:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:12,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:21:12,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:12,284 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-28 03:21:12,418 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:21:12,418 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-28 03:21:12,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:21:12,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:21:12,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:12,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:21:12,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:12,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:12,958 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:13,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:13,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:13,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:21:13,120 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-28 03:21:13,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:13,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (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_2036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:21:13,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (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~mem56#1.base| v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:21:13,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (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| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:21:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768858829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:13,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:21:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-28 03:21:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377838362] [2024-11-28 03:21:13,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:13,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:21:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:13,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:21:13,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=708, Unknown=51, NotChecked=174, Total=1056 [2024-11-28 03:21:13,534 INFO L87 Difference]: Start difference. First operand 1389 states and 1745 transitions. Second operand has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 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-28 03:21:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:16,773 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2024-11-28 03:21:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:21:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-28 03:21:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:16,776 INFO L225 Difference]: With dead ends: 1391 [2024-11-28 03:21:16,776 INFO L226 Difference]: Without dead ends: 1391 [2024-11-28 03:21:16,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=870, Unknown=53, NotChecked=192, Total=1260 [2024-11-28 03:21:16,777 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 687 mSDsluCounter, 6335 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 6834 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:16,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 6834 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 03:21:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-11-28 03:21:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2024-11-28 03:21:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1149 states have (on average 1.5065274151436032) internal successors, (1731), 1378 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:21:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1743 transitions. [2024-11-28 03:21:16,797 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1743 transitions. Word has length 104 [2024-11-28 03:21:16,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:16,798 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1743 transitions. [2024-11-28 03:21:16,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 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-28 03:21:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1743 transitions. [2024-11-28 03:21:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 03:21:16,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:16,799 INFO L218 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-28 03:21:16,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:21:16,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 03:21:17,000 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 354693434, now seen corresponding path program 1 times [2024-11-28 03:21:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298160668] [2024-11-28 03:21:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:18,358 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-28 03:21:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298160668] [2024-11-28 03:21:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298160668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381110239] [2024-11-28 03:21:18,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:18,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:18,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:18,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:18,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:21:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:18,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 03:21:18,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:18,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:21:18,902 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:21:18,902 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-28 03:21:18,912 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-28 03:21:18,922 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-28 03:21:18,928 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-28 03:21:19,023 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-28 03:21:19,028 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-28 03:21:19,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:19,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:19,161 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-28 03:21:19,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:19,266 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-28 03:21:19,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:19,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:19,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:21:19,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:19,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:19,425 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-28 03:21:19,446 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-28 03:21:19,451 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-28 03:21:19,456 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-28 03:21:19,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:19,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2219) |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~mem58#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:21:19,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2217) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2218))) (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~mem57#1.base| v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:21:19,638 WARN L851 $PredicateComparison]: unable to prove that (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))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2218))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2217) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-28 03:21:19,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2215))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2218))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2216) .cse0 v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2215))) (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~mem56#1.base| v_ArrVal_2216) .cse5 v_ArrVal_2217) (select (select (store .cse6 .cse5 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2219))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-28 03:21:20,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2226))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2215))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2218))) (let ((.cse2 (select (select .cse4 |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~mem54#1.base| v_ArrVal_2225) .cse0 v_ArrVal_2216) .cse1 v_ArrVal_2217) .cse2 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2225 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2226))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2215))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2225) .cse7 v_ArrVal_2216) .cse8 v_ArrVal_2217) (select (select (store .cse9 .cse8 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2219))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-28 03:21:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381110239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:20,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:21:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-11-28 03:21:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588612019] [2024-11-28 03:21:20,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:20,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:21:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:20,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:21:20,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=485, Unknown=24, NotChecked=250, Total=870 [2024-11-28 03:21:20,035 INFO L87 Difference]: Start difference. First operand 1388 states and 1743 transitions. Second operand has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:21:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:22,783 INFO L93 Difference]: Finished difference Result 1390 states and 1747 transitions. [2024-11-28 03:21:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:21:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-28 03:21:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:22,787 INFO L225 Difference]: With dead ends: 1390 [2024-11-28 03:21:22,788 INFO L226 Difference]: Without dead ends: 1390 [2024-11-28 03:21:22,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=810, Unknown=24, NotChecked=320, Total=1332 [2024-11-28 03:21:22,788 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 696 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:22,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 3384 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 03:21:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-28 03:21:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1360. [2024-11-28 03:21:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1123 states have (on average 1.5155832591273375) internal successors, (1702), 1352 states have internal predecessors, (1702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:21:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1712 transitions. [2024-11-28 03:21:22,803 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1712 transitions. Word has length 104 [2024-11-28 03:21:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:22,804 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1712 transitions. [2024-11-28 03:21:22,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:21:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1712 transitions. [2024-11-28 03:21:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 03:21:22,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:22,805 INFO L218 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-28 03:21:22,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 03:21:23,006 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 459615374, now seen corresponding path program 1 times [2024-11-28 03:21:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766221495] [2024-11-28 03:21:23,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:23,814 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-28 03:21:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766221495] [2024-11-28 03:21:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766221495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 03:21:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574778177] [2024-11-28 03:21:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:21:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:23,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:21:23,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:21:23,816 INFO L87 Difference]: Start difference. First operand 1360 states and 1712 transitions. Second operand has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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-28 03:21:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:25,784 INFO L93 Difference]: Finished difference Result 1399 states and 1757 transitions. [2024-11-28 03:21:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:21:25,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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-28 03:21:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:25,788 INFO L225 Difference]: With dead ends: 1399 [2024-11-28 03:21:25,788 INFO L226 Difference]: Without dead ends: 1399 [2024-11-28 03:21:25,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 03:21:25,789 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 726 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3387 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 5351 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:25,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 5351 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3387 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 03:21:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-11-28 03:21:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1395. [2024-11-28 03:21:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.5030250648228176) internal successors, (1739), 1385 states have internal predecessors, (1739), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:21:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1751 transitions. [2024-11-28 03:21:25,805 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1751 transitions. Word has length 107 [2024-11-28 03:21:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:25,806 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1751 transitions. [2024-11-28 03:21:25,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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-28 03:21:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1751 transitions. [2024-11-28 03:21:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 03:21:25,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:25,807 INFO L218 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-28 03:21:25,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:21:25,807 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 459615375, now seen corresponding path program 1 times [2024-11-28 03:21:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:25,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139589564] [2024-11-28 03:21:25,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:27,201 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-28 03:21:27,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:27,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139589564] [2024-11-28 03:21:27,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139589564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:27,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:27,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 03:21:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106667329] [2024-11-28 03:21:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:27,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:21:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:27,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:21:27,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:21:27,202 INFO L87 Difference]: Start difference. First operand 1395 states and 1751 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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-28 03:21:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:29,676 INFO L93 Difference]: Finished difference Result 1398 states and 1755 transitions. [2024-11-28 03:21:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:21:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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-28 03:21:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:29,678 INFO L225 Difference]: With dead ends: 1398 [2024-11-28 03:21:29,678 INFO L226 Difference]: Without dead ends: 1398 [2024-11-28 03:21:29,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 03:21:29,679 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 739 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:29,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 4201 Invalid, 3753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3735 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 03:21:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-28 03:21:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1395. [2024-11-28 03:21:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.501296456352636) internal successors, (1737), 1385 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:21:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1749 transitions. [2024-11-28 03:21:29,691 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1749 transitions. Word has length 107 [2024-11-28 03:21:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:29,691 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1749 transitions. [2024-11-28 03:21:29,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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-28 03:21:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1749 transitions. [2024-11-28 03:21:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 03:21:29,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:29,692 INFO L218 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-28 03:21:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:21:29,692 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228933, now seen corresponding path program 1 times [2024-11-28 03:21:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950849699] [2024-11-28 03:21:29,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950849699] [2024-11-28 03:21:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950849699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993260462] [2024-11-28 03:21:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:30,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:30,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:30,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:21:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:30,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 03:21:30,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:30,947 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-28 03:21:31,073 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:21:31,074 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-28 03:21:31,111 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-28 03:21:31,207 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-28 03:21:31,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:31,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:31,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:31,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:31,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:31,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 42 treesize of output 41 [2024-11-28 03:21:31,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:31,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:31,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:31,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:31,655 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-28 03:21:31,735 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-28 03:21:31,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-28 03:21:31,745 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-28 03:21:31,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993260462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:32,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:21:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-28 03:21:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376390320] [2024-11-28 03:21:32,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:32,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:21:32,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:32,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:21:32,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1089, Unknown=54, NotChecked=0, Total=1332 [2024-11-28 03:21:32,579 INFO L87 Difference]: Start difference. First operand 1395 states and 1749 transitions. Second operand has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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-28 03:21:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:21:35,751 INFO L93 Difference]: Finished difference Result 1397 states and 1753 transitions. [2024-11-28 03:21:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:21:35,751 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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 108 [2024-11-28 03:21:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:21:35,753 INFO L225 Difference]: With dead ends: 1397 [2024-11-28 03:21:35,753 INFO L226 Difference]: Without dead ends: 1397 [2024-11-28 03:21:35,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=1149, Unknown=54, NotChecked=0, Total=1406 [2024-11-28 03:21:35,754 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 674 mSDsluCounter, 7265 mSDsCounter, 0 mSdLazyCounter, 4898 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 7766 SdHoareTripleChecker+Invalid, 4911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:21:35,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 7766 Invalid, 4911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4898 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 03:21:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-28 03:21:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1394. [2024-11-28 03:21:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1157 states have (on average 1.4995678478824546) internal successors, (1735), 1384 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:21:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1747 transitions. [2024-11-28 03:21:35,768 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1747 transitions. Word has length 108 [2024-11-28 03:21:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:21:35,768 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1747 transitions. [2024-11-28 03:21:35,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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-28 03:21:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1747 transitions. [2024-11-28 03:21:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 03:21:35,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:21:35,770 INFO L218 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-28 03:21:35,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:21:35,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 03:21:35,971 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:21:35,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228932, now seen corresponding path program 1 times [2024-11-28 03:21:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994704129] [2024-11-28 03:21:35,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994704129] [2024-11-28 03:21:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994704129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608279173] [2024-11-28 03:21:37,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:37,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:37,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:37,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:37,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:21:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:38,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 03:21:38,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:38,028 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-28 03:21:38,151 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-28 03:21:38,165 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:21:38,165 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-28 03:21:38,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:21:38,218 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-28 03:21:38,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 03:21:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:21:38,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:38,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:38,541 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-28 03:21:38,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:38,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:38,693 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-28 03:21:38,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:38,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:38,798 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-28 03:21:38,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:38,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:38,890 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-28 03:21:38,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:21:38,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:21:38,988 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-28 03:21:39,014 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-28 03:21:39,020 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-28 03:21:39,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:21:39,076 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-28 03:21:39,091 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:21:39,091 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-28 03:21:39,097 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-28 03:21:39,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:21:59,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2800))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2787))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2788))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2799) .cse0 v_ArrVal_2786) .cse1 v_ArrVal_2789) .cse2 v_ArrVal_2790) (select (select (store .cse3 .cse2 v_ArrVal_2791) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2793))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2794 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2800))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2787))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2788))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2791))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2799) .cse7 v_ArrVal_2786) .cse8 v_ArrVal_2789) .cse9 v_ArrVal_2790) .cse10 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2794) (select (select (store .cse11 .cse10 v_ArrVal_2792) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-28 03:21:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608279173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:21:59,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:21:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-11-28 03:21:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107364603] [2024-11-28 03:21:59,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:21:59,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:21:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:59,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:21:59,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1301, Unknown=61, NotChecked=76, Total=1640 [2024-11-28 03:21:59,725 INFO L87 Difference]: Start difference. First operand 1394 states and 1747 transitions. Second operand has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:22:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:28,956 INFO L93 Difference]: Finished difference Result 1396 states and 1751 transitions. [2024-11-28 03:22:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:22:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2024-11-28 03:22:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:28,958 INFO L225 Difference]: With dead ends: 1396 [2024-11-28 03:22:28,958 INFO L226 Difference]: Without dead ends: 1396 [2024-11-28 03:22:28,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=246, Invalid=1586, Unknown=64, NotChecked=84, Total=1980 [2024-11-28 03:22:28,959 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 676 mSDsluCounter, 6177 mSDsCounter, 0 mSdLazyCounter, 6013 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 6027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 6013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:28,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 6675 Invalid, 6027 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 6013 Invalid, 0 Unknown, 0 Unchecked, 28.3s Time] [2024-11-28 03:22:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-28 03:22:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1358. [2024-11-28 03:22:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1123 states have (on average 1.5120213713268031) internal successors, (1698), 1350 states have internal predecessors, (1698), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:22:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1708 transitions. [2024-11-28 03:22:28,971 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1708 transitions. Word has length 108 [2024-11-28 03:22:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:28,971 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1708 transitions. [2024-11-28 03:22:28,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:22:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1708 transitions. [2024-11-28 03:22:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:22:28,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:28,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:28,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:22:29,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:29,173 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:22:29,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash 46538489, now seen corresponding path program 1 times [2024-11-28 03:22:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171461127] [2024-11-28 03:22:29,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:29,849 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-28 03:22:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171461127] [2024-11-28 03:22:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171461127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:22:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599085859] [2024-11-28 03:22:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:29,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:22:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:29,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:22:29,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:22:29,851 INFO L87 Difference]: Start difference. First operand 1358 states and 1708 transitions. Second operand has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:22:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:35,294 INFO L93 Difference]: Finished difference Result 1357 states and 1706 transitions. [2024-11-28 03:22:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:22:35,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-28 03:22:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:35,297 INFO L225 Difference]: With dead ends: 1357 [2024-11-28 03:22:35,297 INFO L226 Difference]: Without dead ends: 1357 [2024-11-28 03:22:35,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:22:35,297 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 2 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:35,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3573 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-28 03:22:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-11-28 03:22:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-11-28 03:22:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1123 states have (on average 1.510240427426536) internal successors, (1696), 1349 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:22:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1706 transitions. [2024-11-28 03:22:35,318 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1706 transitions. Word has length 110 [2024-11-28 03:22:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:35,318 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1706 transitions. [2024-11-28 03:22:35,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:22:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1706 transitions. [2024-11-28 03:22:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:22:35,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:35,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:35,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 03:22:35,319 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:22:35,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 46538490, now seen corresponding path program 1 times [2024-11-28 03:22:35,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:35,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999196441] [2024-11-28 03:22:35,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:38,831 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-28 03:22:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999196441] [2024-11-28 03:22:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999196441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:22:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415899639] [2024-11-28 03:22:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:38,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:22:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:38,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:22:38,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:22:38,833 INFO L87 Difference]: Start difference. First operand 1357 states and 1706 transitions. Second operand has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:22:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:50,612 INFO L93 Difference]: Finished difference Result 1401 states and 1755 transitions. [2024-11-28 03:22:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:22:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-28 03:22:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:50,615 INFO L225 Difference]: With dead ends: 1401 [2024-11-28 03:22:50,615 INFO L226 Difference]: Without dead ends: 1401 [2024-11-28 03:22:50,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:22:50,616 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 735 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:50,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2645 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-28 03:22:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-28 03:22:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1398. [2024-11-28 03:22:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1163 states have (on average 1.4935511607910577) internal successors, (1737), 1388 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:22:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1749 transitions. [2024-11-28 03:22:50,627 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1749 transitions. Word has length 110 [2024-11-28 03:22:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1749 transitions. [2024-11-28 03:22:50,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:22:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1749 transitions. [2024-11-28 03:22:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 03:22:50,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:50,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:50,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 03:22:50,629 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:22:50,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2041331821, now seen corresponding path program 1 times [2024-11-28 03:22:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959654956] [2024-11-28 03:22:50,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:53,949 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-28 03:22:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959654956] [2024-11-28 03:22:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959654956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:22:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092836194] [2024-11-28 03:22:53,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:53,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:53,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:53,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:53,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:22:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:54,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 03:22:54,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:54,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:22:55,011 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-28 03:22:55,154 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:22:55,154 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-28 03:22:55,435 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-28 03:22:55,485 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-28 03:22:56,138 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-28 03:22:56,156 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-28 03:22:57,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:22:57,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:22:57,061 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-28 03:22:57,604 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:22:57,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:22:57,642 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-28 03:22:58,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:22:58,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 73 treesize of output 66 [2024-11-28 03:22:58,061 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-28 03:22:58,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:22:58,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:22:58,488 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-28 03:22:58,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:22:58,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:22:58,936 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-28 03:22:59,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:22:59,423 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 20 treesize of output 15 [2024-11-28 03:22:59,555 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:22:59,555 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-28 03:22:59,763 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:22:59,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:22:59,793 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-28 03:22:59,860 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-28 03:22:59,871 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-28 03:22:59,882 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-28 03:22:59,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:23:01,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3195))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3194) .cse0 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse2 .cse0 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3194) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:23:03,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3190))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3192))) (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~mem57#1.base| v_ArrVal_3191) .cse0 v_ArrVal_3193) .cse1 v_ArrVal_3194) (select (select (store .cse2 .cse1 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3198))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 40))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3190))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3192))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3195))) (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~mem57#1.base| v_ArrVal_3191) .cse5 v_ArrVal_3193) .cse6 v_ArrVal_3194) .cse7 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse8 .cse7 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 03:23:14,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3188))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3190))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3192))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3189) .cse0 v_ArrVal_3191) .cse1 v_ArrVal_3193) .cse2 v_ArrVal_3194) (select (select (store .cse3 .cse2 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3198))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3188))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3190))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3192))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3195))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3189) .cse7 v_ArrVal_3191) .cse8 v_ArrVal_3193) .cse9 v_ArrVal_3194) .cse10 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse11 .cse10 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:23:14,382 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_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3188))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3190))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3192))) (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_3189) .cse1 v_ArrVal_3191) .cse2 v_ArrVal_3193) .cse3 v_ArrVal_3194) (select (select (store .cse4 .cse3 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3198))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3188))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3190))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3192))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3195))) (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_3189) .cse8 v_ArrVal_3191) .cse9 v_ArrVal_3193) .cse10 v_ArrVal_3194) .cse11 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse12 .cse11 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-28 03:23:14,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3204))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3188))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3190))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3192))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3203) .cse0 v_ArrVal_3189) .cse1 v_ArrVal_3191) .cse2 v_ArrVal_3193) .cse3 v_ArrVal_3194) (select (select (store .cse4 .cse3 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3198))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3204))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_3188))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3190))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3192))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3195))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3203) .cse9 v_ArrVal_3189) .cse10 v_ArrVal_3191) .cse11 v_ArrVal_3193) .cse12 v_ArrVal_3194) .cse13 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse14 .cse13 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:23:14,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092836194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:23:14,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:23:14,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2024-11-28 03:23:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220143694] [2024-11-28 03:23:14,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:23:14,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:23:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:23:14,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:23:14,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1226, Unknown=41, NotChecked=390, Total=1892 [2024-11-28 03:23:14,723 INFO L87 Difference]: Start difference. First operand 1398 states and 1749 transitions. Second operand has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:23:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:23:36,076 INFO L93 Difference]: Finished difference Result 1400 states and 1753 transitions. [2024-11-28 03:23:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:23:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2024-11-28 03:23:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:23:36,078 INFO L225 Difference]: With dead ends: 1400 [2024-11-28 03:23:36,078 INFO L226 Difference]: Without dead ends: 1400 [2024-11-28 03:23:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=261, Invalid=1437, Unknown=44, NotChecked=420, Total=2162 [2024-11-28 03:23:36,079 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 678 mSDsluCounter, 4213 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:23:36,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 4710 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 20.7s Time] [2024-11-28 03:23:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-28 03:23:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1356. [2024-11-28 03:23:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1123 states have (on average 1.508459483526269) internal successors, (1694), 1348 states have internal predecessors, (1694), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:23:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1704 transitions. [2024-11-28 03:23:36,095 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1704 transitions. Word has length 111 [2024-11-28 03:23:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:23:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1704 transitions. [2024-11-28 03:23:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:23:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1704 transitions. [2024-11-28 03:23:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 03:23:36,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:23:36,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:23:36,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 03:23:36,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:23:36,298 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:23:36,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:23:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash -845632555, now seen corresponding path program 1 times [2024-11-28 03:23:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:23:36,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988688533] [2024-11-28 03:23:36,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:23:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:23:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:23:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:23:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:23:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988688533] [2024-11-28 03:23:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988688533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:23:38,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:23:38,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:23:38,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102408108] [2024-11-28 03:23:38,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:23:38,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:23:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:23:38,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:23:38,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:23:38,277 INFO L87 Difference]: Start difference. First operand 1356 states and 1704 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:23:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:23:48,495 INFO L93 Difference]: Finished difference Result 1355 states and 1702 transitions. [2024-11-28 03:23:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:23:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-28 03:23:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:23:48,498 INFO L225 Difference]: With dead ends: 1355 [2024-11-28 03:23:48,498 INFO L226 Difference]: Without dead ends: 1355 [2024-11-28 03:23:48,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:23:48,499 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 748 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:23:48,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2936 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 03:23:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-11-28 03:23:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2024-11-28 03:23:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1123 states have (on average 1.5066785396260018) internal successors, (1692), 1347 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:23:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1702 transitions. [2024-11-28 03:23:48,510 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1702 transitions. Word has length 113 [2024-11-28 03:23:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:23:48,510 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1702 transitions. [2024-11-28 03:23:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:23:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1702 transitions. [2024-11-28 03:23:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 03:23:48,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:23:48,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:23:48,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 03:23:48,512 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:23:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:23:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -845632554, now seen corresponding path program 1 times [2024-11-28 03:23:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:23:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015313839] [2024-11-28 03:23:48,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:23:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:23:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:23:52,125 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-28 03:23:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:23:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015313839] [2024-11-28 03:23:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015313839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:23:52,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:23:52,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:23:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765816887] [2024-11-28 03:23:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:23:52,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:23:52,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:23:52,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:23:52,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:23:52,127 INFO L87 Difference]: Start difference. First operand 1355 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:24:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:05,200 INFO L93 Difference]: Finished difference Result 1354 states and 1700 transitions. [2024-11-28 03:24:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:24:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-28 03:24:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:05,202 INFO L225 Difference]: With dead ends: 1354 [2024-11-28 03:24:05,202 INFO L226 Difference]: Without dead ends: 1354 [2024-11-28 03:24:05,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:24:05,203 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1454 mSDsluCounter, 2611 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:05,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 3109 Invalid, 2484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2024-11-28 03:24:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-28 03:24:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2024-11-28 03:24:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1123 states have (on average 1.5048975957257347) internal successors, (1690), 1346 states have internal predecessors, (1690), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:24:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1700 transitions. [2024-11-28 03:24:05,219 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1700 transitions. Word has length 113 [2024-11-28 03:24:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:05,219 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1700 transitions. [2024-11-28 03:24:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:24:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1700 transitions. [2024-11-28 03:24:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:24:05,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:05,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:05,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 03:24:05,220 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:24:05,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2039410445, now seen corresponding path program 1 times [2024-11-28 03:24:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222877699] [2024-11-28 03:24:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:05,478 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-28 03:24:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222877699] [2024-11-28 03:24:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222877699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:24:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99658035] [2024-11-28 03:24:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:24:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:05,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:24:05,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:24:05,480 INFO L87 Difference]: Start difference. First operand 1354 states and 1700 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:24:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:09,047 INFO L93 Difference]: Finished difference Result 1353 states and 1698 transitions. [2024-11-28 03:24:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:24:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-28 03:24:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:09,049 INFO L225 Difference]: With dead ends: 1353 [2024-11-28 03:24:09,049 INFO L226 Difference]: Without dead ends: 1353 [2024-11-28 03:24:09,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:24:09,050 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 5 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:09,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2417 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:24:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-28 03:24:09,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-28 03:24:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1123 states have (on average 1.5031166518254675) internal successors, (1688), 1345 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:24:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1698 transitions. [2024-11-28 03:24:09,064 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1698 transitions. Word has length 116 [2024-11-28 03:24:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:09,064 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1698 transitions. [2024-11-28 03:24:09,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:24:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1698 transitions. [2024-11-28 03:24:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:24:09,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:09,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 03:24:09,065 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:24:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2039410446, now seen corresponding path program 1 times [2024-11-28 03:24:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456585090] [2024-11-28 03:24:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:09,434 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-28 03:24:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456585090] [2024-11-28 03:24:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456585090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:24:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825635818] [2024-11-28 03:24:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:24:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:24:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:24:09,435 INFO L87 Difference]: Start difference. First operand 1353 states and 1698 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:24:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:13,365 INFO L93 Difference]: Finished difference Result 1352 states and 1696 transitions. [2024-11-28 03:24:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:24:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-28 03:24:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:13,367 INFO L225 Difference]: With dead ends: 1352 [2024-11-28 03:24:13,367 INFO L226 Difference]: Without dead ends: 1352 [2024-11-28 03:24:13,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:24:13,368 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 4 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:13,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2375 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 03:24:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-28 03:24:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2024-11-28 03:24:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1123 states have (on average 1.5013357079252003) internal successors, (1686), 1344 states have internal predecessors, (1686), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:24:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1696 transitions. [2024-11-28 03:24:13,381 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1696 transitions. Word has length 116 [2024-11-28 03:24:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:13,381 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1696 transitions. [2024-11-28 03:24:13,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:24:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1696 transitions. [2024-11-28 03:24:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 03:24:13,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:13,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:13,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 03:24:13,383 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:24:13,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1202784935, now seen corresponding path program 1 times [2024-11-28 03:24:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:13,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501578731] [2024-11-28 03:24:13,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:24:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501578731] [2024-11-28 03:24:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501578731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:24:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555873979] [2024-11-28 03:24:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:24:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:16,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:24:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:24:16,503 INFO L87 Difference]: Start difference. First operand 1352 states and 1696 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-28 03:24:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:33,038 INFO L93 Difference]: Finished difference Result 1435 states and 1795 transitions. [2024-11-28 03:24:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:24:33,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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 117 [2024-11-28 03:24:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:33,040 INFO L225 Difference]: With dead ends: 1435 [2024-11-28 03:24:33,040 INFO L226 Difference]: Without dead ends: 1435 [2024-11-28 03:24:33,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 03:24:33,041 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 772 mSDsluCounter, 4430 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 4927 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:33,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 4927 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2024-11-28 03:24:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-28 03:24:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1407. [2024-11-28 03:24:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1177 states have (on average 1.4791843670348344) internal successors, (1741), 1397 states have internal predecessors, (1741), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 03:24:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1757 transitions. [2024-11-28 03:24:33,061 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1757 transitions. Word has length 117 [2024-11-28 03:24:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:33,061 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1757 transitions. [2024-11-28 03:24:33,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-28 03:24:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1757 transitions. [2024-11-28 03:24:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 03:24:33,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:33,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:33,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 03:24:33,063 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:24:33,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1202784934, now seen corresponding path program 1 times [2024-11-28 03:24:33,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:33,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409518240] [2024-11-28 03:24:33,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:37,077 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-28 03:24:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409518240] [2024-11-28 03:24:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409518240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:24:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899466410] [2024-11-28 03:24:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:24:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:37,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:24:37,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:24:37,079 INFO L87 Difference]: Start difference. First operand 1407 states and 1757 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-28 03:24:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:56,981 INFO L93 Difference]: Finished difference Result 1434 states and 1793 transitions. [2024-11-28 03:24:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:24:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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 117 [2024-11-28 03:24:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:56,982 INFO L225 Difference]: With dead ends: 1434 [2024-11-28 03:24:56,983 INFO L226 Difference]: Without dead ends: 1434 [2024-11-28 03:24:56,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 03:24:56,983 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 802 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:56,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 4957 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2024-11-28 03:24:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-11-28 03:24:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1407. [2024-11-28 03:24:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1175 states have (on average 1.48) internal successors, (1739), 1397 states have internal predecessors, (1739), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 03:24:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1755 transitions. [2024-11-28 03:24:57,003 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1755 transitions. Word has length 117 [2024-11-28 03:24:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:57,003 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1755 transitions. [2024-11-28 03:24:57,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-28 03:24:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1755 transitions. [2024-11-28 03:24:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 03:24:57,004 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:57,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-28 03:24:57,005 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:24:57,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2087134074, now seen corresponding path program 1 times [2024-11-28 03:24:57,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:57,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154971255] [2024-11-28 03:24:57,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:57,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:00,497 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-28 03:25:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154971255] [2024-11-28 03:25:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154971255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:25:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464230109] [2024-11-28 03:25:00,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:00,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:25:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:25:00,500 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:25:00,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:25:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:00,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 03:25:00,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:25:00,934 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-28 03:25:01,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:25:01,709 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-28 03:25:01,889 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-28 03:25:01,904 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-28 03:25:02,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:02,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:02,406 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-28 03:25:02,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:02,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 51 treesize of output 48 [2024-11-28 03:25:02,688 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-28 03:25:02,963 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:02,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:02,985 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-28 03:25:03,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:25:03,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 03:25:03,592 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:03,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:03,605 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-28 03:25:03,888 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-28 03:25:04,222 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 03:25:04,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:04,253 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-28 03:25:04,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:25:04,877 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 03:25:04,877 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-28 03:25:04,899 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-28 03:25:05,013 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-28 03:25:05,264 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 03:25:05,265 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-28 03:25:05,275 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-28 03:25:05,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:25:05,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (or (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= v_ArrVal_4017 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) .cse2 (select v_ArrVal_4017 .cse2))))))) is different from false [2024-11-28 03:25:05,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse2 (select v_ArrVal_4017 .cse2))) v_ArrVal_4017)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4017))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-28 03:25:05,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4015))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 03:25:05,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 184 [2024-11-28 03:25:05,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_12|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4015)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4017 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4017 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))) is different from false [2024-11-28 03:25:05,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |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|) .cse1))) (let ((.cse2 (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|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 03:25:06,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4013)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))))))))) is different from false [2024-11-28 03:25:06,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (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_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-28 03:25:06,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4010)) (.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_4013))) (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~mem58#1.base| v_ArrVal_4011) .cse9 v_ArrVal_4012))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))) v_ArrVal_4017)))))))))) is different from false [2024-11-28 03:25:06,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (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 ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4010))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4011) .cse10 v_ArrVal_4012))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))))))))))))))) is different from false [2024-11-28 03:25:07,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4009)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4010))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4008) .cse9 v_ArrVal_4011) .cse10 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4017 .cse4))) v_ArrVal_4017)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 03:25:07,153 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (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_4009))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4010))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4013))) (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_4008) .cse10 v_ArrVal_4011) .cse11 v_ArrVal_4012))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))))))))))))))))) is different from false [2024-11-28 03:25:07,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4006)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4009))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4010))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4007) .cse9 v_ArrVal_4008) .cse10 v_ArrVal_4011) .cse11 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-28 03:25:07,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (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 ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4006))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4009))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4010))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4007) .cse10 v_ArrVal_4008) .cse11 v_ArrVal_4011) .cse12 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4015)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4017 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4017 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-11-28 03:25:08,015 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4023)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4006))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4009))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4010))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4024) .cse9 v_ArrVal_4007) .cse10 v_ArrVal_4008) .cse11 v_ArrVal_4011) .cse12 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4017 (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4017 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-11-28 03:25:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464230109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:25:08,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:25:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-11-28 03:25:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744664458] [2024-11-28 03:25:08,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:25:08,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:25:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:08,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:25:08,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=960, Unknown=14, NotChecked=1050, Total=2162 [2024-11-28 03:25:08,024 INFO L87 Difference]: Start difference. First operand 1407 states and 1755 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:25:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:25:35,865 INFO L93 Difference]: Finished difference Result 1431 states and 1789 transitions. [2024-11-28 03:25:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:25:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 03:25:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:25:35,867 INFO L225 Difference]: With dead ends: 1431 [2024-11-28 03:25:35,867 INFO L226 Difference]: Without dead ends: 1431 [2024-11-28 03:25:35,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=256, Invalid=1948, Unknown=14, NotChecked=1442, Total=3660 [2024-11-28 03:25:35,868 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 717 mSDsluCounter, 8296 mSDsCounter, 0 mSdLazyCounter, 5459 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 8793 SdHoareTripleChecker+Invalid, 5481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:25:35,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 8793 Invalid, 5481 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5459 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2024-11-28 03:25:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-11-28 03:25:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1406. [2024-11-28 03:25:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1175 states have (on average 1.4782978723404254) internal successors, (1737), 1396 states have internal predecessors, (1737), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 03:25:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1753 transitions. [2024-11-28 03:25:35,882 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1753 transitions. Word has length 118 [2024-11-28 03:25:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:25:35,882 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1753 transitions. [2024-11-28 03:25:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:25:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1753 transitions. [2024-11-28 03:25:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 03:25:35,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:25:35,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:35,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 03:25:36,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-28 03:25:36,083 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:25:36,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2087134073, now seen corresponding path program 1 times [2024-11-28 03:25:36,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:36,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47172461] [2024-11-28 03:25:36,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:39,828 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-28 03:25:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47172461] [2024-11-28 03:25:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47172461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:25:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853794448] [2024-11-28 03:25:39,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:25:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:25:39,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:25:39,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:25:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:40,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-28 03:25:40,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:25:40,265 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-28 03:25:41,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:25:41,001 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-28 03:25:41,165 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-28 03:25:41,175 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-28 03:25:41,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:41,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:41,705 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-28 03:25:41,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:41,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:41,998 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-28 03:25:42,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:42,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:42,297 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-28 03:25:42,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:42,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:42,612 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-28 03:25:42,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:25:42,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:25:42,944 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-28 03:25:43,237 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-28 03:25:43,629 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 03:25:43,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:25:43,653 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-28 03:25:44,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:25:44,379 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 03:25:44,379 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-28 03:25:44,468 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-28 03:25:44,468 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-28 03:25:45,010 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 03:25:45,010 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-28 03:25:45,027 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-28 03:25:45,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:25:45,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4250 (Array Int Int))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (< 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4249))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store .cse2 .cse3 (select v_ArrVal_4249 .cse3)) v_ArrVal_4249)))) (not (= (store .cse4 .cse3 (select v_ArrVal_4250 .cse3)) v_ArrVal_4250)))) (forall ((v_ArrVal_4250 (Array Int Int))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4249)) (.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4250))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))) (not (= (store .cse2 .cse3 (select v_ArrVal_4249 .cse3)) v_ArrVal_4249)))) (not (= (store .cse4 .cse3 (select v_ArrVal_4250 .cse3)) v_ArrVal_4250)))))) is different from false [2024-11-28 03:25:46,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4249 .cse1)) v_ArrVal_4249)) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_4249)) (.cse5 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_4250))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))) (not (= v_ArrVal_4250 (store .cse8 .cse1 (select v_ArrVal_4250 .cse1))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (not (= v_ArrVal_4250 (store .cse8 .cse10 (select v_ArrVal_4250 .cse10)))) (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= (store .cse0 .cse10 (select v_ArrVal_4249 .cse10)) v_ArrVal_4249)) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_4249))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse9))))))) is different from false [2024-11-28 03:25:46,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse9 (select .cse8 .cse7)) (.cse11 (select .cse6 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (let ((.cse1 (store .cse8 .cse7 v_ArrVal_4249)) (.cse4 (store .cse6 .cse7 v_ArrVal_4250))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select .cse1 .cse2) .cse3) 383) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_4249 (store .cse9 .cse10 (select v_ArrVal_4249 .cse10)))))) (not (= v_ArrVal_4250 (store .cse11 .cse10 (select v_ArrVal_4250 .cse10))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse12 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= v_ArrVal_4249 (store .cse9 .cse12 (select v_ArrVal_4249 .cse12)))) (< 0 (+ (let ((.cse13 (store .cse8 .cse7 v_ArrVal_4249))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))) (not (= v_ArrVal_4250 (store .cse11 .cse12 (select v_ArrVal_4250 .cse12))))))))))))) is different from false [2024-11-28 03:25:46,880 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-28 03:25:48,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse0 (store .cse2 .cse3 v_prenex_42))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_prenex_42 (store (select .cse2 .cse3) .cse5 (select v_prenex_42 .cse5)))) (not (= v_prenex_41 (store (select .cse4 .cse3) .cse5 (select v_prenex_41 .cse5)))) (< v_prenex_40 .cse6))))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse10 (+ 40 v_prenex_40)) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_prenex_42 (store (select .cse8 .cse9) .cse10 (select v_prenex_42 .cse10)))) (not (= v_prenex_41 (store (select .cse4 .cse9) .cse10 (select v_prenex_41 .cse10)))) (< (let ((.cse11 (store .cse4 .cse9 v_prenex_41))) (select (select .cse11 (select (select (store .cse8 .cse9 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_40 .cse6))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse12 (store .cse4 .cse14 v_ArrVal_4249))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse6) (not (= (store (select .cse4 .cse14) .cse15 (select v_ArrVal_4249 .cse15)) v_ArrVal_4249)) (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4250 .cse15)) v_ArrVal_4250))))))))) is different from false [2024-11-28 03:25:50,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 v_prenex_40))) (or (< (let ((.cse0 (store .cse4 .cse2 v_prenex_41))) (select (select .cse0 (select (select (store .cse1 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< v_prenex_40 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse1 .cse2) .cse5 (select v_prenex_42 .cse5)) v_prenex_42)) (not (= v_prenex_41 (store (select .cse4 .cse2) .cse5 (select v_prenex_41 .cse5)))))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse13 (+ 40 v_prenex_40)) (.cse10 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (< v_prenex_40 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse11 .cse12) .cse13 (select v_prenex_42 .cse13)) v_prenex_42)) (not (= v_prenex_41 (store (select .cse10 .cse12) .cse13 (select v_prenex_41 .cse13)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse14 (store .cse11 .cse12 v_prenex_42))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse10 .cse12 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ 1 (let ((.cse19 (store .cse22 .cse21 v_ArrVal_4249))) (select (select .cse19 (select (select (store .cse20 .cse21 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse20 .cse21) .cse23 (select v_ArrVal_4250 .cse23)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse22 .cse21) .cse23 (select v_ArrVal_4249 .cse23)))))))))))) is different from false [2024-11-28 03:25:51,198 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_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse2 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (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 ((.cse9 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4245 .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4250 .cse5)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse6 .cse7) .cse5 (select v_ArrVal_4249 .cse5)))) (< 0 (+ (let ((.cse8 (store .cse6 .cse7 v_ArrVal_4249))) (select (select .cse8 (select (select (store .cse9 .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse20 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (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~malloc61#1.base_15|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 v_prenex_40)) (.cse15 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0)))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse12 (store .cse13 .cse14 v_prenex_42))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse15 .cse14 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse16 .cse17 (store v_ArrVal_4244 .cse18 0)) .cse14) .cse19 (select v_prenex_41 .cse19)) v_prenex_41)) (not (= (store (select .cse13 .cse14) .cse19 (select v_prenex_42 .cse19)) v_prenex_42)) (< v_prenex_40 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse27 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (+ 40 v_prenex_40)) (.cse24 (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 0)))) (or (< (let ((.cse21 (store .cse24 .cse23 v_prenex_41))) (select (select .cse21 (select (select (store .cse22 .cse23 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_41 (store (select .cse24 .cse23) .cse25 (select v_prenex_41 .cse25)))) (not (= (store (let ((.cse26 (store .cse27 .cse28 (store v_ArrVal_4245 .cse29 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_prenex_42 .cse25)) v_prenex_42)) (< v_prenex_40 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-28 03:25:52,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (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~malloc61#1.base_15|)))) (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_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_41 (store (select .cse0 .cse2) .cse3 (select v_prenex_41 .cse3)))) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_41))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_42 (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_42 .cse3)))))))))))) (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse23 v_ArrVal_4244)) (.cse21 (store .cse22 .cse23 v_ArrVal_4245))) (let ((.cse14 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse21 .cse14 (store (select .cse21 .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse17 (+ 40 v_prenex_40)) (.cse18 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 0))) (.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select (store .cse13 .cse14 (store v_ArrVal_4244 .cse15 0)) .cse16) .cse17 (select v_prenex_41 .cse17)) v_prenex_41)) (< v_prenex_40 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse16) .cse17 (select v_prenex_42 .cse17)) v_prenex_42)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse20 (store .cse19 .cse16 v_prenex_42))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse16 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (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~mem58#1.base| v_ArrVal_4242) .cse35 v_ArrVal_4244)) (.cse28 (store .cse34 .cse35 v_ArrVal_4245))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse26 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse25 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (store .cse33 .cse29 (store (select .cse33 .cse29) .cse30 0)))) (or (not (= (store (select .cse24 .cse25) .cse26 (select v_ArrVal_4249 .cse26)) v_ArrVal_4249)) (not (= (store (let ((.cse27 (store .cse28 .cse29 (store v_ArrVal_4245 .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse26 (select v_ArrVal_4250 .cse26)) v_ArrVal_4250)) (< 0 (+ (let ((.cse31 (store .cse24 .cse25 v_ArrVal_4249))) (select (select .cse31 (select (select (store .cse32 .cse25 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 03:25:53,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (+ 40 v_prenex_40)) (.cse5 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= (store (select (store .cse0 .cse1 (store v_ArrVal_4244 .cse2 0)) .cse3) .cse4 (select v_prenex_41 .cse4)) v_prenex_41)) (< v_prenex_40 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (not (= v_prenex_42 (store (select .cse7 .cse3) .cse4 (select v_prenex_42 .cse4)))) (= (select (let ((.cse8 (store .cse7 .cse3 v_prenex_42))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse5 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) |v_ULTIMATE.start_main_#t~malloc61#1.base_15|))))))))) (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse24 v_ArrVal_4244)) (.cse15 (store .cse23 .cse24 v_ArrVal_4245))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse20 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse13 (store .cse22 .cse16 (store (select .cse22 .cse16) .cse17 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse18 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (not (= v_prenex_42 (store (let ((.cse14 (store .cse15 .cse16 (store v_ArrVal_4245 .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse18 (select v_prenex_42 .cse18)))) (< (let ((.cse19 (store .cse13 .cse21 v_prenex_41))) (select (select .cse19 (select (select (store .cse20 .cse21 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (select .cse13 .cse21) .cse18 (select v_prenex_41 .cse18)) v_prenex_41)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse34 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse36 v_ArrVal_4244)) (.cse29 (store .cse35 .cse36 v_ArrVal_4245))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse33 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse25 (store .cse34 .cse30 (store (select .cse34 .cse30) .cse31 0))) (.cse26 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= v_ArrVal_4249 (store (select .cse25 .cse26) .cse27 (select v_ArrVal_4249 .cse27)))) (not (= (store (let ((.cse28 (store .cse29 .cse30 (store v_ArrVal_4245 .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse27 (select v_ArrVal_4250 .cse27)) v_ArrVal_4250)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (< 0 (+ (let ((.cse32 (store .cse25 .cse26 v_ArrVal_4249))) (select (select .cse32 (select (select (store .cse33 .cse26 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1))))))))))))) is different from false [2024-11-28 03:25:54,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse13 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse6 (store .cse11 .cse12 v_ArrVal_4245))) (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~malloc61#1.base_15|)))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4249))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (let ((.cse5 (store .cse6 .cse7 (store v_ArrVal_4245 .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse9 (select v_ArrVal_4250 .cse9)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse4 .cse2) .cse9 (select v_ArrVal_4249 .cse9)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4243))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse26 v_ArrVal_4242) .cse25 v_ArrVal_4244)) (.cse23 (store .cse24 .cse25 v_ArrVal_4245))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse15 (store .cse16 .cse17 v_prenex_42))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse18 .cse17 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select (store .cse19 .cse20 (store v_ArrVal_4244 .cse21 0)) .cse17) .cse22 (select v_prenex_41 .cse22)) v_prenex_41)) (< v_prenex_40 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_42 (store (select .cse16 .cse17) .cse22 (select v_prenex_42 .cse22)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4243))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse40 v_ArrVal_4242) .cse39 v_ArrVal_4244)) (.cse29 (store .cse38 .cse39 v_ArrVal_4245))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse31 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse36 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse32 (+ 40 v_prenex_40)) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse33 (store .cse37 .cse30 (store (select .cse37 .cse30) .cse31 0)))) (or (not (= v_prenex_42 (store (let ((.cse28 (store .cse29 .cse30 (store v_ArrVal_4245 .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse32 (select v_prenex_42 .cse32)))) (not (= (store (select .cse33 .cse34) .cse32 (select v_prenex_41 .cse32)) v_prenex_41)) (< (let ((.cse35 (store .cse33 .cse34 v_prenex_41))) (select (select .cse35 (select (select (store .cse36 .cse34 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< v_prenex_40 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 03:25:55,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse14 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (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~malloc61#1.base_15|)))) (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_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse0 .cse2) .cse3 (select v_prenex_41 .cse3)) v_prenex_41)) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_41))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_42) |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_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_42 .cse3)) v_prenex_42)))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse29 .cse28 v_ArrVal_4243))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse28 v_ArrVal_4242) .cse27 v_ArrVal_4244)) (.cse20 (store .cse26 .cse27 v_ArrVal_4245))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse16 (store .cse25 .cse21 (store (select .cse25 .cse21) .cse22 0))) (.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4249 .cse18)) v_ArrVal_4249)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4245 .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4250 .cse18)) v_ArrVal_4250)) (< 0 (+ (let ((.cse23 (store .cse16 .cse17 v_ArrVal_4249))) (select (select .cse23 (select (select (store .cse24 .cse17 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4243))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse41 v_ArrVal_4242) .cse40 v_ArrVal_4244)) (.cse38 (store .cse39 .cse40 v_ArrVal_4245))) (let ((.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (store .cse38 .cse32 (store (select .cse38 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (+ 40 v_prenex_40)) (.cse30 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_40 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse31 .cse32 (store v_ArrVal_4244 .cse33 0)) .cse34) .cse35 (select v_prenex_41 .cse35)) v_prenex_41)) (not (= v_prenex_42 (store (select .cse36 .cse34) .cse35 (select v_prenex_42 .cse35)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse37 (store .cse36 .cse34 v_prenex_42))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse30 .cse34 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-28 03:25:58,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4240))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse12 v_ArrVal_4241) .cse13 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse2 (store .cse3 .cse4 v_prenex_42))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select .cse3 .cse4) .cse5 (select v_prenex_42 .cse5)) v_prenex_42)) (not (= v_prenex_41 (store (select (store .cse6 .cse7 (store v_ArrVal_4244 .cse8 0)) .cse4) .cse5 (select v_prenex_41 .cse5)))))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_4240))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse30 .cse29 v_ArrVal_4243))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse28 v_ArrVal_4241) .cse29 v_ArrVal_4242) .cse27 v_ArrVal_4244)) (.cse20 (store .cse26 .cse27 v_ArrVal_4245))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse16 (store .cse25 .cse21 (store (select .cse25 .cse21) .cse22 0))) (.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4249 .cse18)) v_ArrVal_4249)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4250 (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4245 .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4250 .cse18)))) (< 0 (+ (let ((.cse23 (store .cse16 .cse17 v_ArrVal_4249))) (select (select .cse23 (select (select (store .cse24 .cse17 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse47 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4240))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4243))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse44 v_ArrVal_4241) .cse45 v_ArrVal_4242) .cse43 v_ArrVal_4244)) (.cse38 (store .cse42 .cse43 v_ArrVal_4245))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 0))) (.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (+ 40 v_prenex_40))) (or (< (let ((.cse32 (store .cse35 .cse34 v_prenex_41))) (select (select .cse32 (select (select (store .cse33 .cse34 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_40 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse35 .cse34) .cse36 (select v_prenex_41 .cse36)) v_prenex_41)) (not (= (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4245 .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse36 (select v_prenex_42 .cse36)) v_prenex_42)))))))))))))))) is different from false [2024-11-28 03:25:59,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4240))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse13 v_ArrVal_4241) .cse14 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (+ 40 v_prenex_40)) (.cse8 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)))) (or (not (= (store (select (store .cse0 .cse1 (store v_ArrVal_4244 .cse2 0)) .cse3) .cse4 (select v_prenex_41 .cse4)) v_prenex_41)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse5 (store .cse7 .cse3 v_prenex_42))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse8 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (not (= (store (select .cse7 .cse3) .cse4 (select v_prenex_42 .cse4)) v_prenex_42)) (< v_prenex_40 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse32 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4240))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4243))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse29 v_ArrVal_4241) .cse30 v_ArrVal_4242) .cse28 v_ArrVal_4244)) (.cse22 (store .cse27 .cse28 v_ArrVal_4245))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse25 (+ 40 v_prenex_40)) (.cse20 (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 0)))) (or (< (let ((.cse17 (store .cse20 .cse19 v_prenex_41))) (select (select .cse17 (select (select (store .cse18 .cse19 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4245 .cse24 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse25 (select v_prenex_42 .cse25)) v_prenex_42)) (not (= (store (select .cse20 .cse19) .cse25 (select v_prenex_41 .cse25)) v_prenex_41)) (< v_prenex_40 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4240))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4243))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse45 v_ArrVal_4241) .cse46 v_ArrVal_4242) .cse44 v_ArrVal_4244)) (.cse38 (store .cse43 .cse44 v_ArrVal_4245))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse34 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse41 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse36 (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 0)))) (or (< 0 (+ (let ((.cse33 (store .cse36 .cse35 v_ArrVal_4249))) (select (select .cse33 (select (select (store .cse34 .cse35 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)) (not (= v_ArrVal_4250 (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4245 .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse41 (select v_ArrVal_4250 .cse41)))) (not (= v_ArrVal_4249 (store (select .cse36 .cse35) .cse41 (select v_ArrVal_4249 .cse41)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))))))))) is different from false [2024-11-28 03:26:01,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int)) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4238))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4240))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse13 v_ArrVal_4239) .cse14 v_ArrVal_4241) .cse15 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse4 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4249))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= v_ArrVal_4249 (store (select .cse4 .cse2) .cse5 (select v_ArrVal_4249 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4250 (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4250 .cse5)))))))))))))))))) (forall ((v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4238))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4240))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4243))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse30 v_ArrVal_4239) .cse31 v_ArrVal_4241) .cse32 v_ArrVal_4242) .cse29 v_ArrVal_4244)) (.cse27 (store .cse28 .cse29 v_ArrVal_4245))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse19 (store .cse20 .cse21 v_prenex_42))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse22 .cse21 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< v_prenex_40 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_42 (store (select .cse20 .cse21) .cse23 (select v_prenex_42 .cse23)))) (not (= (store (select (store .cse24 .cse25 (store v_ArrVal_4244 .cse26 0)) .cse21) .cse23 (select v_prenex_41 .cse23)) v_prenex_41)))))))))))))))) (forall ((v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4238))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4240))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4243))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse48 v_ArrVal_4239) .cse49 v_ArrVal_4241) .cse50 v_ArrVal_4242) .cse47 v_ArrVal_4244)) (.cse42 (store .cse46 .cse47 v_ArrVal_4245))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse44 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse36 (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 0))) (.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse40 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (< (let ((.cse37 (store .cse36 .cse39 v_prenex_41))) (select (select .cse37 (select (select (store .cse38 .cse39 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= v_prenex_41 (store (select .cse36 .cse39) .cse40 (select v_prenex_41 .cse40)))) (not (= (store (let ((.cse41 (store .cse42 .cse43 (store v_ArrVal_4245 .cse44 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse40 (select v_prenex_42 .cse40)) v_prenex_42)))))))))))))))))) is different from false [2024-11-28 03:26:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853794448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:26:02,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:26:02,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-11-28 03:26:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409631578] [2024-11-28 03:26:02,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:26:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:26:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:26:02,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:26:02,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1201, Unknown=13, NotChecked=1066, Total=2450 [2024-11-28 03:26:02,196 INFO L87 Difference]: Start difference. First operand 1406 states and 1753 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:26:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:26:34,175 INFO L93 Difference]: Finished difference Result 1430 states and 1787 transitions. [2024-11-28 03:26:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:26:34,176 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 03:26:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:26:34,177 INFO L225 Difference]: With dead ends: 1430 [2024-11-28 03:26:34,177 INFO L226 Difference]: Without dead ends: 1430 [2024-11-28 03:26:34,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=307, Invalid=2282, Unknown=13, NotChecked=1430, Total=4032 [2024-11-28 03:26:34,179 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 745 mSDsluCounter, 7964 mSDsCounter, 0 mSdLazyCounter, 5875 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:26:34,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 8458 Invalid, 5897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5875 Invalid, 0 Unknown, 0 Unchecked, 29.3s Time] [2024-11-28 03:26:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-28 03:26:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1350. [2024-11-28 03:26:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1121 states have (on average 1.5004460303300624) internal successors, (1682), 1342 states have internal predecessors, (1682), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:26:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1692 transitions. [2024-11-28 03:26:34,191 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1692 transitions. Word has length 118 [2024-11-28 03:26:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:26:34,191 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1692 transitions. [2024-11-28 03:26:34,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:26:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1692 transitions. [2024-11-28 03:26:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 03:26:34,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:26:34,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:26:34,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 03:26:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-28 03:26:34,393 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:26:34,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:26:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash 686956707, now seen corresponding path program 1 times [2024-11-28 03:26:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:26:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017275109] [2024-11-28 03:26:34,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:26:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:26:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:26:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:26:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:26:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017275109] [2024-11-28 03:26:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017275109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:26:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:26:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:26:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832588431] [2024-11-28 03:26:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:26:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:26:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:26:34,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:26:34,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:26:34,552 INFO L87 Difference]: Start difference. First operand 1350 states and 1692 transitions. Second operand has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:26:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:26:37,171 INFO L93 Difference]: Finished difference Result 1650 states and 2071 transitions. [2024-11-28 03:26:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:26:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-28 03:26:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:26:37,174 INFO L225 Difference]: With dead ends: 1650 [2024-11-28 03:26:37,174 INFO L226 Difference]: Without dead ends: 1650 [2024-11-28 03:26:37,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:26:37,174 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1494 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:26:37,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 911 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 03:26:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-28 03:26:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1534. [2024-11-28 03:26:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1316 states have (on average 1.4620060790273557) internal successors, (1924), 1526 states have internal predecessors, (1924), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:26:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1934 transitions. [2024-11-28 03:26:37,187 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1934 transitions. Word has length 127 [2024-11-28 03:26:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:26:37,187 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 1934 transitions. [2024-11-28 03:26:37,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:26:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1934 transitions. [2024-11-28 03:26:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 03:26:37,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:26:37,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:26:37,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-28 03:26:37,188 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:26:37,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:26:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash 686956708, now seen corresponding path program 1 times [2024-11-28 03:26:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:26:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015853737] [2024-11-28 03:26:37,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:26:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:26:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:26:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:26:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:26:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015853737] [2024-11-28 03:26:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015853737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:26:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:26:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:26:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487388128] [2024-11-28 03:26:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:26:37,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:26:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:26:37,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:26:37,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:26:37,498 INFO L87 Difference]: Start difference. First operand 1534 states and 1934 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:26:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:26:41,147 INFO L93 Difference]: Finished difference Result 2008 states and 2501 transitions. [2024-11-28 03:26:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:26:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-28 03:26:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:26:41,151 INFO L225 Difference]: With dead ends: 2008 [2024-11-28 03:26:41,151 INFO L226 Difference]: Without dead ends: 2008 [2024-11-28 03:26:41,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:26:41,151 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 2460 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:26:41,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 1052 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 03:26:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-11-28 03:26:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1819. [2024-11-28 03:26:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1623 states have (on average 1.4460874922982132) internal successors, (2347), 1811 states have internal predecessors, (2347), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:26:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2357 transitions. [2024-11-28 03:26:41,176 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2357 transitions. Word has length 127 [2024-11-28 03:26:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:26:41,176 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2357 transitions. [2024-11-28 03:26:41,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:26:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2357 transitions. [2024-11-28 03:26:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 03:26:41,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:26:41,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:26:41,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-28 03:26:41,178 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:26:41,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:26:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -179177775, now seen corresponding path program 1 times [2024-11-28 03:26:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:26:41,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18554362] [2024-11-28 03:26:41,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:26:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:26:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:26:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:26:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:26:41,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18554362] [2024-11-28 03:26:41,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18554362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:26:41,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521345941] [2024-11-28 03:26:41,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:26:41,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:26:41,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:26:41,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:26:41,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:26:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:26:42,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 03:26:42,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:26:42,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-28 03:26:42,878 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:26:42,878 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-28 03:26:42,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:26:43,420 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:26:43,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:26:43,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:26:43,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:26:43,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:26:43,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:26:44,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:26:44,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:26:44,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:26:44,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:26:44,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:26:44,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:26:44,801 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-28 03:26:45,355 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-28 03:26:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:26:45,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:26:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521345941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:26:45,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:26:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4] total 18 [2024-11-28 03:26:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699608200] [2024-11-28 03:26:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:26:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:26:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:26:45,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:26:45,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:26:45,481 INFO L87 Difference]: Start difference. First operand 1819 states and 2357 transitions. Second operand has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 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-28 03:27:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:27:00,733 INFO L93 Difference]: Finished difference Result 1894 states and 2441 transitions. [2024-11-28 03:27:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:27:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 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 128 [2024-11-28 03:27:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:27:00,735 INFO L225 Difference]: With dead ends: 1894 [2024-11-28 03:27:00,735 INFO L226 Difference]: Without dead ends: 1894 [2024-11-28 03:27:00,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:27:00,736 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 707 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:27:00,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4873 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 13.9s Time] [2024-11-28 03:27:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-11-28 03:27:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1888. [2024-11-28 03:27:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1689 states have (on average 1.4292480757844879) internal successors, (2414), 1876 states have internal predecessors, (2414), 7 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-28 03:27:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2435 transitions. [2024-11-28 03:27:00,756 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2435 transitions. Word has length 128 [2024-11-28 03:27:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:27:00,756 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2435 transitions. [2024-11-28 03:27:00,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 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-28 03:27:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2435 transitions. [2024-11-28 03:27:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 03:27:00,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:27:00,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:27:00,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 03:27:00,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:27:00,958 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:27:00,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:27:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -179177774, now seen corresponding path program 1 times [2024-11-28 03:27:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:27:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408057124] [2024-11-28 03:27:00,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:27:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:27:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:27:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:27:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:27:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408057124] [2024-11-28 03:27:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408057124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:27:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598160231] [2024-11-28 03:27:01,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:27:01,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:27:01,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:27:01,223 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:27:01,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:27:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:27:01,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-28 03:27:01,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:27:01,743 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-28 03:27:03,408 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-28 03:27:03,523 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:27:03,524 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-28 03:27:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:27:03,804 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-28 03:27:04,236 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-28 03:27:04,249 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-28 03:27:05,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:27:05,231 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 90 treesize of output 50 [2024-11-28 03:27:05,245 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-28 03:27:05,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:27:05,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:27:05,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:27:06,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:27:06,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:27:06,303 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-28 03:27:06,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:27:06,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:27:06,801 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-28 03:27:07,328 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:27:07,328 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-28 03:27:07,342 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-28 03:27:07,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:27:07,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:27:07,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:27:08,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:27:08,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:27:08,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:27:08,427 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-28 03:27:08,440 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-28 03:27:09,239 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-28 03:27:09,261 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-28 03:27:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:27:09,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:27:11,295 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_4871 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:27:11,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4870) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4869))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4870) .cse1 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:27:12,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4866))) (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~mem59#1.base| v_ArrVal_4867) .cse0 v_ArrVal_4870) (select (select (store .cse1 .cse0 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4871))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)))) (forall ((v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4866))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_4869))) (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~mem59#1.base| v_ArrVal_4867) .cse3 v_ArrVal_4870) .cse4 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 16) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse5 .cse4 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 03:27:17,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0))) (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4862))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_4864))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_4866))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4863) .cse0 v_ArrVal_4865) .cse1 v_ArrVal_4867) .cse2 v_ArrVal_4870) (select (select (store .cse3 .cse2 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4871))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 12)))) (forall ((v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4862))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_4864))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_4866))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4869))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4863) .cse7 v_ArrVal_4865) .cse8 v_ArrVal_4867) .cse9 v_ArrVal_4870) .cse10 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 16) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse11 .cse10 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-28 03:27:51,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_33| Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_33| .cse0) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_33|) v_ArrVal_4861)))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_4862))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_4864))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_4866))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4860) .cse2 v_ArrVal_4863) .cse3 v_ArrVal_4865) .cse4 v_ArrVal_4867) .cse5 v_ArrVal_4870) (select (select (store .cse6 .cse5 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_4871))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 13))))) (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_33| .cse0) (forall ((v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_33|) v_ArrVal_4861)))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_4862))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_4864))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_4866))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_4869))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (<= (+ 16 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4860) .cse12 v_ArrVal_4863) .cse13 v_ArrVal_4865) .cse14 v_ArrVal_4867) .cse15 v_ArrVal_4870) .cse16 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse17 .cse16 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))))))))))))))))))) is different from false [2024-11-28 03:27:52,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598160231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:27:52,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:27:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 16] total 19 [2024-11-28 03:27:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459180628] [2024-11-28 03:27:52,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:27:52,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:27:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:27:52,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:27:52,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=755, Unknown=58, NotChecked=310, Total=1260 [2024-11-28 03:27:52,564 INFO L87 Difference]: Start difference. First operand 1888 states and 2435 transitions. Second operand has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:28:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:28:31,130 INFO L93 Difference]: Finished difference Result 2108 states and 2714 transitions. [2024-11-28 03:28:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:28:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 128 [2024-11-28 03:28:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:28:31,134 INFO L225 Difference]: With dead ends: 2108 [2024-11-28 03:28:31,134 INFO L226 Difference]: Without dead ends: 2106 [2024-11-28 03:28:31,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=149, Invalid=867, Unknown=60, NotChecked=330, Total=1406 [2024-11-28 03:28:31,135 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 589 mSDsluCounter, 5144 mSDsCounter, 0 mSdLazyCounter, 4599 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 5688 SdHoareTripleChecker+Invalid, 4603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:28:31,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 5688 Invalid, 4603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4599 Invalid, 0 Unknown, 0 Unchecked, 37.8s Time] [2024-11-28 03:28:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2024-11-28 03:28:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1822. [2024-11-28 03:28:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1626 states have (on average 1.4440344403444034) internal successors, (2348), 1814 states have internal predecessors, (2348), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 03:28:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2359 transitions. [2024-11-28 03:28:31,161 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2359 transitions. Word has length 128 [2024-11-28 03:28:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:28:31,161 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2359 transitions. [2024-11-28 03:28:31,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:28:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2359 transitions. [2024-11-28 03:28:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-28 03:28:31,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:28:31,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:28:31,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 03:28:31,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-11-28 03:28:31,363 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:28:31,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:28:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1407225235, now seen corresponding path program 1 times [2024-11-28 03:28:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:28:31,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446985997] [2024-11-28 03:28:31,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:28:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:28:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:28:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:28:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:28:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446985997] [2024-11-28 03:28:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446985997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:28:31,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653753783] [2024-11-28 03:28:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:28:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:28:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:28:31,963 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:28:31,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 03:28:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:28:32,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 03:28:32,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:28:32,465 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-28 03:28:32,497 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-28 03:28:34,982 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:28:34,982 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-28 03:28:35,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:28:35,175 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-28 03:28:35,208 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-28 03:28:35,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 03:28:35,891 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 9 treesize of output 3 [2024-11-28 03:28:36,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:36,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:28:36,809 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-28 03:28:37,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:37,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:28:37,451 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-28 03:28:37,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:37,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:28:38,012 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-28 03:28:38,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:38,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:28:38,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:28:39,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:39,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:28:39,193 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-28 03:28:39,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:28:39,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:28:39,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:28:39,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:28:40,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:40,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:28:40,199 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-28 03:28:40,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:28:40,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:28:41,039 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-28 03:28:42,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-28 03:28:42,441 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-28 03:28:44,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:28:44,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-28 03:28:44,307 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-28 03:28:44,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-11-28 03:28:45,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:28:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:28:45,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:28:47,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653753783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:28:47,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:28:47,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 24] total 28 [2024-11-28 03:28:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526862944] [2024-11-28 03:28:47,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:28:47,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 03:28:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:28:47,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 03:28:47,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2024-11-28 03:28:47,298 INFO L87 Difference]: Start difference. First operand 1822 states and 2359 transitions. Second operand has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:29:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:45,328 INFO L93 Difference]: Finished difference Result 2135 states and 2745 transitions. [2024-11-28 03:29:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 03:29:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 130 [2024-11-28 03:29:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:45,332 INFO L225 Difference]: With dead ends: 2135 [2024-11-28 03:29:45,332 INFO L226 Difference]: Without dead ends: 2131 [2024-11-28 03:29:45,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=307, Invalid=2345, Unknown=0, NotChecked=0, Total=2652 [2024-11-28 03:29:45,333 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 634 mSDsluCounter, 6072 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 6519 SdHoareTripleChecker+Invalid, 6240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:45,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 6519 Invalid, 6240 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 52.2s Time] [2024-11-28 03:29:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-11-28 03:29:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1841. [2024-11-28 03:29:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1644 states have (on average 1.4409975669099757) internal successors, (2369), 1830 states have internal predecessors, (2369), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-28 03:29:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2382 transitions. [2024-11-28 03:29:45,361 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2382 transitions. Word has length 130 [2024-11-28 03:29:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:45,362 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2382 transitions. [2024-11-28 03:29:45,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:29:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2382 transitions. [2024-11-28 03:29:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-28 03:29:45,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:45,363 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:45,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 03:29:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2024-11-28 03:29:45,563 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:29:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1138591865, now seen corresponding path program 1 times [2024-11-28 03:29:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022295790] [2024-11-28 03:29:45,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:29:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022295790] [2024-11-28 03:29:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022295790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185966089] [2024-11-28 03:29:46,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:46,590 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:46,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 03:29:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:47,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 03:29:47,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:47,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-28 03:29:48,555 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:29:48,555 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-28 03:29:48,728 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-28 03:29:48,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:29:49,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 03:29:49,400 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 9 treesize of output 3 [2024-11-28 03:29:50,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:29:50,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:29:50,282 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-28 03:29:50,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:29:50,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:29:50,894 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-28 03:29:51,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:29:51,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 51 treesize of output 48 [2024-11-28 03:29:51,377 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-28 03:29:51,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:29:51,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:29:51,935 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-28 03:29:52,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:29:52,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 51 treesize of output 48 [2024-11-28 03:29:52,488 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-28 03:29:53,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:29:53,089 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-28 03:29:53,498 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 03:29:53,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 62 [2024-11-28 03:29:53,515 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 50 treesize of output 31 [2024-11-28 03:29:54,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:29:54,441 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 03:29:54,441 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 101 treesize of output 64 [2024-11-28 03:29:54,476 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 69 treesize of output 48 [2024-11-28 03:29:56,456 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 03:29:56,456 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 50 treesize of output 25 [2024-11-28 03:29:56,474 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 23 treesize of output 11 [2024-11-28 03:29:57,655 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-28 03:29:57,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 109 [2024-11-28 03:29:57,777 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:29:57,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 89 [2024-11-28 03:29:57,815 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 30 treesize of output 14 [2024-11-28 03:29:58,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-28 03:29:58,902 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-28 03:29:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:29:59,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:00,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5375 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_5376 (Array Int Int)) (v_ArrVal_5375 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:30:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185966089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:30:00,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:30:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 29 [2024-11-28 03:30:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513436661] [2024-11-28 03:30:00,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:00,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:30:00,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:30:00,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:30:00,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2024-11-28 03:30:00,983 INFO L87 Difference]: Start difference. First operand 1841 states and 2382 transitions. Second operand has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:31:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:02,201 INFO L93 Difference]: Finished difference Result 1853 states and 2393 transitions. [2024-11-28 03:31:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 03:31:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 131 [2024-11-28 03:31:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:02,204 INFO L225 Difference]: With dead ends: 1853 [2024-11-28 03:31:02,204 INFO L226 Difference]: Without dead ends: 1847 [2024-11-28 03:31:02,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=257, Invalid=2502, Unknown=1, NotChecked=102, Total=2862 [2024-11-28 03:31:02,205 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 649 mSDsluCounter, 9005 mSDsCounter, 0 mSdLazyCounter, 6547 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 9499 SdHoareTripleChecker+Invalid, 6562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 6547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:02,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 9499 Invalid, 6562 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 6547 Invalid, 0 Unknown, 0 Unchecked, 55.1s Time] [2024-11-28 03:31:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-28 03:31:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1839. [2024-11-28 03:31:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1643 states have (on average 1.440657334144857) internal successors, (2367), 1830 states have internal predecessors, (2367), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:31:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2377 transitions. [2024-11-28 03:31:02,230 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2377 transitions. Word has length 131 [2024-11-28 03:31:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2377 transitions. [2024-11-28 03:31:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:31:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2377 transitions. [2024-11-28 03:31:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-28 03:31:02,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:02,232 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:02,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 03:31:02,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2024-11-28 03:31:02,436 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:31:02,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash -195138029, now seen corresponding path program 2 times [2024-11-28 03:31:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:02,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029647163] [2024-11-28 03:31:02,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:31:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:02,475 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:31:02,475 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:31:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 03:31:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029647163] [2024-11-28 03:31:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029647163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:31:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:31:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:31:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065690698] [2024-11-28 03:31:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:31:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:03,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:31:03,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:31:03,544 INFO L87 Difference]: Start difference. First operand 1839 states and 2377 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:07,033 INFO L93 Difference]: Finished difference Result 1864 states and 2402 transitions. [2024-11-28 03:31:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:31:07,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 134 [2024-11-28 03:31:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:07,037 INFO L225 Difference]: With dead ends: 1864 [2024-11-28 03:31:07,037 INFO L226 Difference]: Without dead ends: 1864 [2024-11-28 03:31:07,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:31:07,038 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 40 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:07,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3369 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 03:31:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-11-28 03:31:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1859. [2024-11-28 03:31:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1663 states have (on average 1.4353577871316898) internal successors, (2387), 1850 states have internal predecessors, (2387), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:31:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2397 transitions. [2024-11-28 03:31:07,061 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2397 transitions. Word has length 134 [2024-11-28 03:31:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:07,061 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2397 transitions. [2024-11-28 03:31:07,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2397 transitions. [2024-11-28 03:31:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-28 03:31:07,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:07,063 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:07,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-28 03:31:07,063 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:31:07,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1894579468, now seen corresponding path program 1 times [2024-11-28 03:31:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938641441] [2024-11-28 03:31:07,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 03:31:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938641441] [2024-11-28 03:31:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938641441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:31:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:31:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:31:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147530026] [2024-11-28 03:31:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:31:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:31:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:31:08,185 INFO L87 Difference]: Start difference. First operand 1859 states and 2397 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:12,135 INFO L93 Difference]: Finished difference Result 1884 states and 2427 transitions. [2024-11-28 03:31:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:31:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 135 [2024-11-28 03:31:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:12,139 INFO L225 Difference]: With dead ends: 1884 [2024-11-28 03:31:12,139 INFO L226 Difference]: Without dead ends: 1884 [2024-11-28 03:31:12,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:31:12,140 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 9 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3991 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:12,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3991 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 03:31:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-28 03:31:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1879. [2024-11-28 03:31:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1683 states have (on average 1.4331550802139037) internal successors, (2412), 1870 states have internal predecessors, (2412), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:31:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2422 transitions. [2024-11-28 03:31:12,162 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2422 transitions. Word has length 135 [2024-11-28 03:31:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:12,162 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2422 transitions. [2024-11-28 03:31:12,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2422 transitions. [2024-11-28 03:31:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-28 03:31:12,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:12,163 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:12,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-28 03:31:12,164 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:31:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1878717280, now seen corresponding path program 1 times [2024-11-28 03:31:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628876465] [2024-11-28 03:31:12,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 03:31:13,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:13,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628876465] [2024-11-28 03:31:13,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628876465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:31:13,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:31:13,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:31:13,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731545184] [2024-11-28 03:31:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:13,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:31:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:13,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:31:13,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:31:13,391 INFO L87 Difference]: Start difference. First operand 1879 states and 2422 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:17,627 INFO L93 Difference]: Finished difference Result 1904 states and 2452 transitions. [2024-11-28 03:31:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:31:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 135 [2024-11-28 03:31:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:17,630 INFO L225 Difference]: With dead ends: 1904 [2024-11-28 03:31:17,630 INFO L226 Difference]: Without dead ends: 1904 [2024-11-28 03:31:17,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:31:17,631 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 10 mSDsluCounter, 3938 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4663 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:17,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4663 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 03:31:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2024-11-28 03:31:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1879. [2024-11-28 03:31:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1683 states have (on average 1.4331550802139037) internal successors, (2412), 1870 states have internal predecessors, (2412), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:31:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2422 transitions. [2024-11-28 03:31:17,646 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2422 transitions. Word has length 135 [2024-11-28 03:31:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:17,646 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2422 transitions. [2024-11-28 03:31:17,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2422 transitions. [2024-11-28 03:31:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:31:17,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:17,647 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-28 03:31:17,647 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:31:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1243230239, now seen corresponding path program 1 times [2024-11-28 03:31:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458494507] [2024-11-28 03:31:17,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-28 03:31:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:19,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458494507] [2024-11-28 03:31:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458494507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:31:19,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:31:19,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:31:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566343552] [2024-11-28 03:31:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:19,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:31:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:19,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:31:19,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:31:19,459 INFO L87 Difference]: Start difference. First operand 1879 states and 2422 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:24,685 INFO L93 Difference]: Finished difference Result 1934 states and 2492 transitions. [2024-11-28 03:31:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:31:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2024-11-28 03:31:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:24,688 INFO L225 Difference]: With dead ends: 1934 [2024-11-28 03:31:24,688 INFO L226 Difference]: Without dead ends: 1934 [2024-11-28 03:31:24,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:31:24,689 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 28 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:24,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5443 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 03:31:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-28 03:31:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1919. [2024-11-28 03:31:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1723 states have (on average 1.42890307603018) internal successors, (2462), 1910 states have internal predecessors, (2462), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:31:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2472 transitions. [2024-11-28 03:31:24,704 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2472 transitions. Word has length 136 [2024-11-28 03:31:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:24,704 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 2472 transitions. [2024-11-28 03:31:24,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:31:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2472 transitions. [2024-11-28 03:31:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-28 03:31:24,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:24,705 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:31:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-28 03:31:24,705 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:31:24,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1561513565, now seen corresponding path program 1 times [2024-11-28 03:31:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:31:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177936952] [2024-11-28 03:31:24,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:31:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:31:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:31:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177936952] [2024-11-28 03:31:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177936952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:31:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016609785] [2024-11-28 03:31:25,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:25,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:25,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:25,592 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:25,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 03:31:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:26,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-28 03:31:26,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:26,161 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-28 03:31:26,210 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-28 03:31:28,921 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:31:28,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:31:29,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:31:29,044 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-28 03:31:29,208 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-28 03:31:29,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 03:31:30,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:30,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:31:31,374 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:31,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:31:31,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:31,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:31:32,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:32,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:31:33,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:33,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:31:33,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:31:33,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:31:33,586 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:31:33,587 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-28 03:31:33,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:33,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:31:34,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:34,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:31:34,784 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-28 03:31:35,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 03:31:35,906 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-28 03:31:38,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:31:38,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-28 03:31:38,598 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-28 03:31:38,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-11-28 03:31:39,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:31:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:31:39,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016609785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:31:41,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:31:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 30 [2024-11-28 03:31:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845515742] [2024-11-28 03:31:41,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:31:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:31:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:31:41,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:31:41,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 03:31:41,906 INFO L87 Difference]: Start difference. First operand 1919 states and 2472 transitions. Second operand has 30 states, 29 states have (on average 8.827586206896552) internal successors, (256), 29 states have internal predecessors, (256), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:32:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:32:32,698 INFO L93 Difference]: Finished difference Result 2209 states and 2830 transitions. [2024-11-28 03:32:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-28 03:32:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.827586206896552) internal successors, (256), 29 states have internal predecessors, (256), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 137 [2024-11-28 03:32:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:32:32,702 INFO L225 Difference]: With dead ends: 2209 [2024-11-28 03:32:32,702 INFO L226 Difference]: Without dead ends: 2207 [2024-11-28 03:32:32,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=323, Invalid=2647, Unknown=0, NotChecked=0, Total=2970 [2024-11-28 03:32:32,703 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 632 mSDsluCounter, 4910 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 5357 SdHoareTripleChecker+Invalid, 5231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:32:32,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 5357 Invalid, 5231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 44.5s Time] [2024-11-28 03:32:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2024-11-28 03:32:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1920. [2024-11-28 03:32:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1724 states have (on average 1.427494199535963) internal successors, (2461), 1911 states have internal predecessors, (2461), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:32:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2471 transitions. [2024-11-28 03:32:32,719 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2471 transitions. Word has length 137 [2024-11-28 03:32:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:32:32,719 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2471 transitions. [2024-11-28 03:32:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.827586206896552) internal successors, (256), 29 states have internal predecessors, (256), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:32:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2471 transitions. [2024-11-28 03:32:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-28 03:32:32,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:32:32,720 INFO L218 NwaCegarLoop]: trace histogram [7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:32:32,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-28 03:32:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-11-28 03:32:32,921 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:32:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:32:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1344112263, now seen corresponding path program 1 times [2024-11-28 03:32:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:32:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831073158] [2024-11-28 03:32:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:32:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:32:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:32:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 03:32:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:32:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831073158] [2024-11-28 03:32:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831073158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:32:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479844755] [2024-11-28 03:32:34,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:32:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:32:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:32:34,061 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:32:34,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 03:32:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:32:34,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-28 03:32:34,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:32:34,645 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-28 03:32:34,678 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-28 03:32:37,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:32:37,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:32:37,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:32:37,660 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-28 03:32:38,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 03:32:39,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:39,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:32:39,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 03:32:40,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:40,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:32:41,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:41,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:32:41,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:41,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:32:42,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:32:42,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:32:42,213 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:32:42,213 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-28 03:32:42,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:42,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:32:43,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:43,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 03:32:43,780 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-28 03:32:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:32:51,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-28 03:32:52,218 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-28 03:32:52,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-11-28 03:32:53,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:53,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:32:54,010 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-28 03:32:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 03:32:54,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:32:58,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6514 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse0) v_ArrVal_6514) |c_ULTIMATE.start_main_~users~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:32:59,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6514 (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_6514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:32:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479844755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:32:59,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:32:59,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23] total 30 [2024-11-28 03:32:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374342407] [2024-11-28 03:32:59,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:32:59,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:32:59,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:32:59,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:32:59,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=996, Unknown=27, NotChecked=130, Total=1260 [2024-11-28 03:32:59,853 INFO L87 Difference]: Start difference. First operand 1920 states and 2471 transitions. Second operand has 30 states, 29 states have (on average 9.206896551724139) internal successors, (267), 29 states have internal predecessors, (267), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:33:03,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:06,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:12,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:16,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:33,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:39,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:43,742 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 03:33:43,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 03:33:43,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=288, Invalid=2341, Unknown=31, NotChecked=202, Total=2862 [2024-11-28 03:33:43,743 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 84 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:43,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2177 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1010 Invalid, 5 Unknown, 0 Unchecked, 34.0s Time] [2024-11-28 03:33:43,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 03:33:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:43,945 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:388) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-28 03:33:43,950 INFO L158 Benchmark]: Toolchain (without parser) took 835635.27ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 101.9MB in the beginning and 327.1MB in the end (delta: -225.2MB). Peak memory consumption was 501.5MB. Max. memory is 16.1GB. [2024-11-28 03:33:43,950 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:33:43,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1008.41ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 68.5MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:33:43,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.57ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 60.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:33:43,950 INFO L158 Benchmark]: Boogie Preprocessor took 221.42ms. Allocated memory is still 142.6MB. Free memory was 60.9MB in the beginning and 47.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:33:43,950 INFO L158 Benchmark]: RCFGBuilder took 3705.92ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 47.4MB in the beginning and 265.2MB in the end (delta: -217.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:33:43,951 INFO L158 Benchmark]: TraceAbstraction took 830581.54ms. Allocated memory was 352.3MB in the beginning and 872.4MB in the end (delta: 520.1MB). Free memory was 264.3MB in the beginning and 327.1MB in the end (delta: -62.8MB). Peak memory consumption was 454.7MB. Max. memory is 16.1GB. [2024-11-28 03:33:43,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1008.41ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 68.5MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.57ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 60.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 221.42ms. Allocated memory is still 142.6MB. Free memory was 60.9MB in the beginning and 47.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 3705.92ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 47.4MB in the beginning and 265.2MB in the end (delta: -217.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 830581.54ms. Allocated memory was 352.3MB in the beginning and 872.4MB in the end (delta: 520.1MB). Free memory was 264.3MB in the beginning and 327.1MB in the end (delta: -62.8MB). Peak memory consumption was 454.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bff8bd1c-fa1a-4625-85c4-4f60a0e25894/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...