./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:42:15,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:42:15,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 23:42:15,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:42:15,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:42:15,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:42:15,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:42:15,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:42:15,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:42:15,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:42:15,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:42:15,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:42:15,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:42:15,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:42:15,537 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:42:15,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:42:15,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:42:15,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:42:15,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:42:15,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:42:15,538 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:42:15,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:42:15,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:42:15,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:42:15,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:42:15,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:42:15,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:42:15,541 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_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-23 23:42:15,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:42:15,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:42:15,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:42:15,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:42:15,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:42:15,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-23 23:42:19,900 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/data/b95c3983c/39f6aefbb3c54bf9ab229d7a167d342b/FLAGd57add59a [2024-11-23 23:42:20,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:42:20,500 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-23 23:42:20,531 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/data/b95c3983c/39f6aefbb3c54bf9ab229d7a167d342b/FLAGd57add59a [2024-11-23 23:42:20,551 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/data/b95c3983c/39f6aefbb3c54bf9ab229d7a167d342b [2024-11-23 23:42:20,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:42:20,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:42:20,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:42:20,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:42:20,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:42:20,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:42:20" (1/1) ... [2024-11-23 23:42:20,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6a2b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:20, skipping insertion in model container [2024-11-23 23:42:20,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:42:20" (1/1) ... [2024-11-23 23:42:20,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:42:21,161 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-23 23:42:21,206 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-23 23:42:21,212 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-23 23:42:21,218 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-23 23:42:21,228 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-23 23:42:21,275 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-23 23:42:21,279 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-23 23:42:21,283 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-23 23:42:21,292 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-23 23:42:21,309 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-23 23:42:21,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:42:21,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:42:21,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:42:21,622 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:42:21,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21 WrapperNode [2024-11-23 23:42:21,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:42:21,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:42:21,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:42:21,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:42:21,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:21,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:21,776 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-23 23:42:21,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:42:21,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:42:21,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:42:21,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:42:21,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:21,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:21,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:21,941 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-23 23:42:21,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:21,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:42:22,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:42:22,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:42:22,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:42:22,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (1/1) ... [2024-11-23 23:42:22,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:42:22,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:42:22,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:42:22,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:42:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 23:42:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 23:42:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:42:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:42:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-23 23:42:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-23 23:42:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-23 23:42:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-23 23:42:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:42:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:42:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:42:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:42:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:42:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:42:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:42:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:42:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:42:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:42:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:42:22,582 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:42:22,585 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:42:22,589 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-23 23:42:22,660 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-23 23:42:27,373 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-23 23:42:27,374 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:42:27,455 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:42:27,455 INFO L312 CfgBuilder]: Removed 34 assume(true) statements. [2024-11-23 23:42:27,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:42:27 BoogieIcfgContainer [2024-11-23 23:42:27,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:42:27,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:42:27,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:42:27,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:42:27,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:42:20" (1/3) ... [2024-11-23 23:42:27,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ad586e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:42:27, skipping insertion in model container [2024-11-23 23:42:27,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:42:21" (2/3) ... [2024-11-23 23:42:27,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ad586e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:42:27, skipping insertion in model container [2024-11-23 23:42:27,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:42:27" (3/3) ... [2024-11-23 23:42:27,476 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-1.i [2024-11-23 23:42:27,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:42:27,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test4-1.i that has 3 procedures, 1438 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2024-11-23 23:42:27,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:42:27,659 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;@65c72d58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:42:27,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-23 23:42:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 1433 states, 803 states have (on average 2.075965130759651) internal successors, (1667), 1425 states have internal predecessors, (1667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-23 23:42:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 23:42:27,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:27,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 23:42:27,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1482281, now seen corresponding path program 1 times [2024-11-23 23:42:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254411133] [2024-11-23 23:42:27,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:27,967 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-23 23:42:27,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:27,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254411133] [2024-11-23 23:42:27,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254411133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:27,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:27,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:42:27,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952513904] [2024-11-23 23:42:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:27,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:42:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:42:28,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:42:28,027 INFO L87 Difference]: Start difference. First operand has 1433 states, 803 states have (on average 2.075965130759651) internal successors, (1667), 1425 states have internal predecessors, (1667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-23 23:42:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:29,621 INFO L93 Difference]: Finished difference Result 1439 states and 1619 transitions. [2024-11-23 23:42:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:42:29,625 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-23 23:42:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:29,647 INFO L225 Difference]: With dead ends: 1439 [2024-11-23 23:42:29,647 INFO L226 Difference]: Without dead ends: 1435 [2024-11-23 23:42:29,650 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-23 23:42:29,654 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 27 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:29,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2552 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-23 23:42:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-23 23:42:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1425. [2024-11-23 23:42:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 806 states have (on average 1.9826302729528535) internal successors, (1598), 1417 states have internal predecessors, (1598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-23 23:42:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1610 transitions. [2024-11-23 23:42:29,892 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1610 transitions. Word has length 4 [2024-11-23 23:42:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1610 transitions. [2024-11-23 23:42:29,893 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-23 23:42:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1610 transitions. [2024-11-23 23:42:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:42:29,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:29,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:42:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:42:29,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1137182981, now seen corresponding path program 1 times [2024-11-23 23:42:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507598413] [2024-11-23 23:42:29,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:30,107 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-23 23:42:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507598413] [2024-11-23 23:42:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507598413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:30,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:42:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244893140] [2024-11-23 23:42:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:30,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:42:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:30,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:42:30,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:42:30,113 INFO L87 Difference]: Start difference. First operand 1425 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:30,946 INFO L93 Difference]: Finished difference Result 2326 states and 2655 transitions. [2024-11-23 23:42:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:42:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:42:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:30,961 INFO L225 Difference]: With dead ends: 2326 [2024-11-23 23:42:30,961 INFO L226 Difference]: Without dead ends: 2324 [2024-11-23 23:42:30,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 23:42:30,963 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1058 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:30,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 4419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-23 23:42:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2024-11-23 23:42:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1965. [2024-11-23 23:42:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1346 states have (on average 1.9576523031203565) internal successors, (2635), 1954 states have internal predecessors, (2635), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2653 transitions. [2024-11-23 23:42:31,056 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2653 transitions. Word has length 7 [2024-11-23 23:42:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:31,056 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2653 transitions. [2024-11-23 23:42:31,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2653 transitions. [2024-11-23 23:42:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:42:31,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:31,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:42:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:42:31,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:31,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636893, now seen corresponding path program 1 times [2024-11-23 23:42:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:31,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450374521] [2024-11-23 23:42:31,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:31,241 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-23 23:42:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450374521] [2024-11-23 23:42:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450374521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:42:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441383501] [2024-11-23 23:42:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:42:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:31,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:42:31,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:42:31,244 INFO L87 Difference]: Start difference. First operand 1965 states and 2653 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:32,732 INFO L93 Difference]: Finished difference Result 1871 states and 2509 transitions. [2024-11-23 23:42:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:42:32,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:42:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:32,743 INFO L225 Difference]: With dead ends: 1871 [2024-11-23 23:42:32,744 INFO L226 Difference]: Without dead ends: 1871 [2024-11-23 23:42:32,744 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-23 23:42:32,745 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1354 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:32,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 889 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-23 23:42:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-11-23 23:42:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2024-11-23 23:42:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1346 states have (on average 1.8506686478454681) internal successors, (2491), 1860 states have internal predecessors, (2491), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2509 transitions. [2024-11-23 23:42:32,808 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2509 transitions. Word has length 7 [2024-11-23 23:42:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:32,809 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2509 transitions. [2024-11-23 23:42:32,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2509 transitions. [2024-11-23 23:42:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:42:32,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:32,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:42:32,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:42:32,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:32,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1134636894, now seen corresponding path program 1 times [2024-11-23 23:42:32,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:32,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579969177] [2024-11-23 23:42:32,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:32,963 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-23 23:42:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579969177] [2024-11-23 23:42:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579969177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 23:42:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961255211] [2024-11-23 23:42:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:42:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:32,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:42:32,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:42:32,965 INFO L87 Difference]: Start difference. First operand 1871 states and 2509 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:34,715 INFO L93 Difference]: Finished difference Result 2503 states and 3362 transitions. [2024-11-23 23:42:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:42:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:42:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:34,728 INFO L225 Difference]: With dead ends: 2503 [2024-11-23 23:42:34,728 INFO L226 Difference]: Without dead ends: 2503 [2024-11-23 23:42:34,729 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-23 23:42:34,730 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 821 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:34,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1965 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-23 23:42:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-23 23:42:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2347. [2024-11-23 23:42:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1832 states have (on average 1.8116812227074235) internal successors, (3319), 2336 states have internal predecessors, (3319), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3337 transitions. [2024-11-23 23:42:34,809 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3337 transitions. Word has length 7 [2024-11-23 23:42:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:34,809 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3337 transitions. [2024-11-23 23:42:34,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3337 transitions. [2024-11-23 23:42:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:42:34,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:34,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:42:34,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:42:34,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -567156950, now seen corresponding path program 1 times [2024-11-23 23:42:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915708311] [2024-11-23 23:42:34,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:34,974 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-23 23:42:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915708311] [2024-11-23 23:42:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915708311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:34,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:34,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:42:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105865280] [2024-11-23 23:42:34,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:34,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:42:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:34,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:42:34,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:42:34,977 INFO L87 Difference]: Start difference. First operand 2347 states and 3337 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:36,802 INFO L93 Difference]: Finished difference Result 2422 states and 3443 transitions. [2024-11-23 23:42:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:42:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-23 23:42:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:36,814 INFO L225 Difference]: With dead ends: 2422 [2024-11-23 23:42:36,815 INFO L226 Difference]: Without dead ends: 2422 [2024-11-23 23:42:36,815 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-23 23:42:36,818 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1622 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:36,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1577 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-23 23:42:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-11-23 23:42:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2324. [2024-11-23 23:42:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1832 states have (on average 1.7865720524017468) internal successors, (3273), 2313 states have internal predecessors, (3273), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3291 transitions. [2024-11-23 23:42:36,902 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3291 transitions. Word has length 13 [2024-11-23 23:42:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:36,904 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3291 transitions. [2024-11-23 23:42:36,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3291 transitions. [2024-11-23 23:42:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 23:42:36,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:36,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:42:36,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:42:36,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:36,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash -567156949, now seen corresponding path program 1 times [2024-11-23 23:42:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:36,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913363307] [2024-11-23 23:42:36,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:37,066 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-23 23:42:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913363307] [2024-11-23 23:42:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913363307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:42:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016177177] [2024-11-23 23:42:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:42:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:42:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:42:37,068 INFO L87 Difference]: Start difference. First operand 2324 states and 3291 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:37,128 INFO L93 Difference]: Finished difference Result 2186 states and 3085 transitions. [2024-11-23 23:42:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:42:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-23 23:42:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:37,140 INFO L225 Difference]: With dead ends: 2186 [2024-11-23 23:42:37,140 INFO L226 Difference]: Without dead ends: 2186 [2024-11-23 23:42:37,141 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-23 23:42:37,143 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 61 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2639 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-23 23:42:37,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2639 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:42:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-23 23:42:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2024-11-23 23:42:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1706 states have (on average 1.7977725674091443) internal successors, (3067), 2175 states have internal predecessors, (3067), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3085 transitions. [2024-11-23 23:42:37,221 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3085 transitions. Word has length 13 [2024-11-23 23:42:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3085 transitions. [2024-11-23 23:42:37,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3085 transitions. [2024-11-23 23:42:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:42:37,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:37,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:42:37,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:42:37,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:37,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash 423295012, now seen corresponding path program 1 times [2024-11-23 23:42:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873172855] [2024-11-23 23:42:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:37,392 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-23 23:42:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:37,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873172855] [2024-11-23 23:42:37,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873172855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:37,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:37,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:42:37,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764191538] [2024-11-23 23:42:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:37,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:42:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:37,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:42:37,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:42:37,395 INFO L87 Difference]: Start difference. First operand 2186 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:37,514 INFO L93 Difference]: Finished difference Result 2157 states and 3035 transitions. [2024-11-23 23:42:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:42:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:42:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:37,570 INFO L225 Difference]: With dead ends: 2157 [2024-11-23 23:42:37,570 INFO L226 Difference]: Without dead ends: 2157 [2024-11-23 23:42:37,570 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-23 23:42:37,572 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 41 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:37,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3905 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:42:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-11-23 23:42:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2151. [2024-11-23 23:42:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 1678 states have (on average 1.794398092967819) internal successors, (3011), 2140 states have internal predecessors, (3011), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3029 transitions. [2024-11-23 23:42:37,639 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3029 transitions. Word has length 15 [2024-11-23 23:42:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:37,641 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3029 transitions. [2024-11-23 23:42:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3029 transitions. [2024-11-23 23:42:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 23:42:37,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:37,642 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] [2024-11-23 23:42:37,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:42:37,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:37,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:37,643 INFO L85 PathProgramCache]: Analyzing trace with hash 912325906, now seen corresponding path program 1 times [2024-11-23 23:42:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:37,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830484863] [2024-11-23 23:42:37,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:37,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:38,020 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-23 23:42:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830484863] [2024-11-23 23:42:38,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830484863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:42:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847984836] [2024-11-23 23:42:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:38,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:42:38,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:38,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:42:38,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:42:38,022 INFO L87 Difference]: Start difference. First operand 2151 states and 3029 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-23 23:42:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:40,122 INFO L93 Difference]: Finished difference Result 2401 states and 3198 transitions. [2024-11-23 23:42:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:42:40,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-23 23:42:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:40,133 INFO L225 Difference]: With dead ends: 2401 [2024-11-23 23:42:40,133 INFO L226 Difference]: Without dead ends: 2401 [2024-11-23 23:42:40,134 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-23 23:42:40,134 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 826 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:40,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2632 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-23 23:42:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-23 23:42:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2147. [2024-11-23 23:42:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1678 states have (on average 1.7896305125148988) internal successors, (3003), 2136 states have internal predecessors, (3003), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3021 transitions. [2024-11-23 23:42:40,199 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3021 transitions. Word has length 29 [2024-11-23 23:42:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:40,201 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3021 transitions. [2024-11-23 23:42:40,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-23 23:42:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3021 transitions. [2024-11-23 23:42:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-23 23:42:40,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:40,204 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] [2024-11-23 23:42:40,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:42:40,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:40,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash -673514776, now seen corresponding path program 1 times [2024-11-23 23:42:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:40,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246890405] [2024-11-23 23:42:40,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:40,449 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-23 23:42:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246890405] [2024-11-23 23:42:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246890405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:40,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:40,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:42:40,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776872796] [2024-11-23 23:42:40,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:40,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:42:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:40,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:42:40,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:42:40,453 INFO L87 Difference]: Start difference. First operand 2147 states and 3021 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-23 23:42:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:40,550 INFO L93 Difference]: Finished difference Result 2147 states and 3013 transitions. [2024-11-23 23:42:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:42:40,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-23 23:42:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:40,560 INFO L225 Difference]: With dead ends: 2147 [2024-11-23 23:42:40,560 INFO L226 Difference]: Without dead ends: 2147 [2024-11-23 23:42:40,560 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-23 23:42:40,562 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 21 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3887 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-23 23:42:40,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3887 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:42:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-11-23 23:42:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2024-11-23 23:42:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1678 states have (on average 1.7848629320619784) internal successors, (2995), 2136 states have internal predecessors, (2995), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3013 transitions. [2024-11-23 23:42:40,663 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3013 transitions. Word has length 63 [2024-11-23 23:42:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:40,663 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3013 transitions. [2024-11-23 23:42:40,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-23 23:42:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3013 transitions. [2024-11-23 23:42:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-23 23:42:40,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:40,669 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] [2024-11-23 23:42:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:42:40,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash -354565324, now seen corresponding path program 1 times [2024-11-23 23:42:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:40,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975092219] [2024-11-23 23:42:40,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:40,876 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-23 23:42:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975092219] [2024-11-23 23:42:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975092219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:40,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:40,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:42:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85120621] [2024-11-23 23:42:40,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:40,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:42:40,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:40,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:42:40,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:42:40,879 INFO L87 Difference]: Start difference. First operand 2147 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-23 23:42:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:40,953 INFO L93 Difference]: Finished difference Result 1916 states and 2610 transitions. [2024-11-23 23:42:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:42:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-23 23:42:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:40,964 INFO L225 Difference]: With dead ends: 1916 [2024-11-23 23:42:40,964 INFO L226 Difference]: Without dead ends: 1916 [2024-11-23 23:42:40,964 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-23 23:42:40,965 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 54 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:40,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2614 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:42:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-23 23:42:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2024-11-23 23:42:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1447 states have (on average 1.7912923289564617) internal successors, (2592), 1905 states have internal predecessors, (2592), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2610 transitions. [2024-11-23 23:42:41,020 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2610 transitions. Word has length 71 [2024-11-23 23:42:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:41,020 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2610 transitions. [2024-11-23 23:42:41,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-23 23:42:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2610 transitions. [2024-11-23 23:42:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 23:42:41,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:41,025 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] [2024-11-23 23:42:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:42:41,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1640032229, now seen corresponding path program 1 times [2024-11-23 23:42:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149444858] [2024-11-23 23:42:41,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:42,073 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-23 23:42:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149444858] [2024-11-23 23:42:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149444858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:42:42,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588307977] [2024-11-23 23:42:42,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:42,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:42:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:42,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:42:42,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:42:42,078 INFO L87 Difference]: Start difference. First operand 1916 states and 2610 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:44,391 INFO L93 Difference]: Finished difference Result 1832 states and 2485 transitions. [2024-11-23 23:42:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:42:44,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-23 23:42:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:44,403 INFO L225 Difference]: With dead ends: 1832 [2024-11-23 23:42:44,403 INFO L226 Difference]: Without dead ends: 1832 [2024-11-23 23:42:44,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:42:44,405 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1157 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:44,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1131 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-23 23:42:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-23 23:42:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1559. [2024-11-23 23:42:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1174 states have (on average 1.6890971039182283) internal successors, (1983), 1548 states have internal predecessors, (1983), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2001 transitions. [2024-11-23 23:42:44,451 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2001 transitions. Word has length 74 [2024-11-23 23:42:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:44,453 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2001 transitions. [2024-11-23 23:42:44,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2001 transitions. [2024-11-23 23:42:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-23 23:42:44,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:44,457 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] [2024-11-23 23:42:44,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:42:44,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:44,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1277110201, now seen corresponding path program 1 times [2024-11-23 23:42:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:44,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541184748] [2024-11-23 23:42:44,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:44,996 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-23 23:42:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541184748] [2024-11-23 23:42:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541184748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:42:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628105981] [2024-11-23 23:42:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:42:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:44,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:42:44,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:42:44,999 INFO L87 Difference]: Start difference. First operand 1559 states and 2001 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-23 23:42:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:46,825 INFO L93 Difference]: Finished difference Result 1558 states and 1999 transitions. [2024-11-23 23:42:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:42:46,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-23 23:42:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:46,834 INFO L225 Difference]: With dead ends: 1558 [2024-11-23 23:42:46,834 INFO L226 Difference]: Without dead ends: 1558 [2024-11-23 23:42:46,834 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-23 23:42:46,835 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:46,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3472 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-23 23:42:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2024-11-23 23:42:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2024-11-23 23:42:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1174 states have (on average 1.6873935264054514) internal successors, (1981), 1547 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1999 transitions. [2024-11-23 23:42:46,888 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1999 transitions. Word has length 79 [2024-11-23 23:42:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:46,889 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1999 transitions. [2024-11-23 23:42:46,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-23 23:42:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1999 transitions. [2024-11-23 23:42:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-23 23:42:46,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:46,893 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] [2024-11-23 23:42:46,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 23:42:46,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:46,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1277110200, now seen corresponding path program 1 times [2024-11-23 23:42:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:46,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609137309] [2024-11-23 23:42:46,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:46,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:47,771 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-23 23:42:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609137309] [2024-11-23 23:42:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609137309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:42:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603625128] [2024-11-23 23:42:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:42:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:47,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:42:47,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:42:47,776 INFO L87 Difference]: Start difference. First operand 1558 states and 1999 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-23 23:42:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:49,759 INFO L93 Difference]: Finished difference Result 1557 states and 1997 transitions. [2024-11-23 23:42:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:42:49,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-23 23:42:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:49,766 INFO L225 Difference]: With dead ends: 1557 [2024-11-23 23:42:49,767 INFO L226 Difference]: Without dead ends: 1557 [2024-11-23 23:42:49,767 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-23 23:42:49,768 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 1 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:49,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3487 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-23 23:42:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-23 23:42:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2024-11-23 23:42:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1172 states have (on average 1.6885665529010239) internal successors, (1979), 1546 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:42:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1997 transitions. [2024-11-23 23:42:49,824 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1997 transitions. Word has length 79 [2024-11-23 23:42:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:49,825 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1997 transitions. [2024-11-23 23:42:49,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-23 23:42:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1997 transitions. [2024-11-23 23:42:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-23 23:42:49,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:49,827 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] [2024-11-23 23:42:49,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 23:42:49,827 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1471579886, now seen corresponding path program 1 times [2024-11-23 23:42:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331508327] [2024-11-23 23:42:49,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:50,228 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-23 23:42:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331508327] [2024-11-23 23:42:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331508327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:50,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:42:50,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318824073] [2024-11-23 23:42:50,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:50,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:42:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:50,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:42:50,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:42:50,234 INFO L87 Difference]: Start difference. First operand 1557 states and 1997 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 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-23 23:42:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:52,489 INFO L93 Difference]: Finished difference Result 1575 states and 2027 transitions. [2024-11-23 23:42:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:42:52,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 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 87 [2024-11-23 23:42:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:52,498 INFO L225 Difference]: With dead ends: 1575 [2024-11-23 23:42:52,499 INFO L226 Difference]: Without dead ends: 1575 [2024-11-23 23:42:52,499 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-23 23:42:52,500 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 6 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5475 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:52,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5475 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-23 23:42:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-23 23:42:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1566. [2024-11-23 23:42:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1180 states have (on average 1.6864406779661016) internal successors, (1990), 1553 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:42:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2017 transitions. [2024-11-23 23:42:52,595 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2017 transitions. Word has length 87 [2024-11-23 23:42:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:52,596 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2017 transitions. [2024-11-23 23:42:52,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 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-23 23:42:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2017 transitions. [2024-11-23 23:42:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-23 23:42:52,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:52,598 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] [2024-11-23 23:42:52,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 23:42:52,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:52,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1471579887, now seen corresponding path program 1 times [2024-11-23 23:42:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979042886] [2024-11-23 23:42:52,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:53,446 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-23 23:42:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:53,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979042886] [2024-11-23 23:42:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979042886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:42:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:42:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:42:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489561810] [2024-11-23 23:42:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:42:53,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:42:53,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:53,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:42:53,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:42:53,448 INFO L87 Difference]: Start difference. First operand 1566 states and 2017 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 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-23 23:42:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:55,654 INFO L93 Difference]: Finished difference Result 1566 states and 2015 transitions. [2024-11-23 23:42:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:42:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 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 87 [2024-11-23 23:42:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:55,665 INFO L225 Difference]: With dead ends: 1566 [2024-11-23 23:42:55,667 INFO L226 Difference]: Without dead ends: 1566 [2024-11-23 23:42:55,668 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-23 23:42:55,668 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 1 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4503 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:55,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4503 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-23 23:42:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-23 23:42:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-23 23:42:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1180 states have (on average 1.6847457627118645) internal successors, (1988), 1553 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:42:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2015 transitions. [2024-11-23 23:42:55,732 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2015 transitions. Word has length 87 [2024-11-23 23:42:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:55,734 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2015 transitions. [2024-11-23 23:42:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 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-23 23:42:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2015 transitions. [2024-11-23 23:42:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 23:42:55,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:55,737 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] [2024-11-23 23:42:55,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:42:55,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:42:55,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1463572569, now seen corresponding path program 1 times [2024-11-23 23:42:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:42:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685116187] [2024-11-23 23:42:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:42:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:56,512 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-23 23:42:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:42:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685116187] [2024-11-23 23:42:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685116187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:42:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042421171] [2024-11-23 23:42:56,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:42:56,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:42:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:42:56,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:42:56,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:42:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:42:56,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-23 23:42:56,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:42:56,948 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-23 23:42:57,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:42:57,182 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-23 23:42:57,207 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-23 23:42:57,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:42:57,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:42:57,391 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-23 23:42:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:42:57,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:42:57,493 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-23 23:42:57,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-23 23:42:57,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-23 23:42:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042421171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:42:57,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:42:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-23 23:42:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744067735] [2024-11-23 23:42:57,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:42:57,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:42:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:42:57,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:42:57,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-23 23:42:57,517 INFO L87 Difference]: Start difference. First operand 1566 states and 2015 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:43:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:00,907 INFO L93 Difference]: Finished difference Result 1565 states and 2013 transitions. [2024-11-23 23:43:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:43:00,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-23 23:43:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:00,913 INFO L225 Difference]: With dead ends: 1565 [2024-11-23 23:43:00,914 INFO L226 Difference]: Without dead ends: 1565 [2024-11-23 23:43:00,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-23 23:43:00,915 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1150 mSDsluCounter, 5117 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 5867 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:00,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 5867 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-23 23:43:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-23 23:43:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2024-11-23 23:43:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1180 states have (on average 1.6830508474576271) internal successors, (1986), 1552 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:43:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2013 transitions. [2024-11-23 23:43:00,952 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2013 transitions. Word has length 88 [2024-11-23 23:43:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:00,953 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2013 transitions. [2024-11-23 23:43:00,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:43:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2013 transitions. [2024-11-23 23:43:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 23:43:00,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:00,954 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] [2024-11-23 23:43:00,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 23:43:01,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-23 23:43:01,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:01,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1463572568, now seen corresponding path program 1 times [2024-11-23 23:43:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:01,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377140358] [2024-11-23 23:43:01,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:02,532 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-23 23:43:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377140358] [2024-11-23 23:43:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377140358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691096690] [2024-11-23 23:43:02,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:02,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:43:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:43:02,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:43:02,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:43:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:02,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-23 23:43:02,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:43:02,884 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-23 23:43:03,078 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:43:03,079 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-23 23:43:03,124 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-23 23:43:03,130 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-23 23:43:03,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:03,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-23 23:43:03,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-23 23:43:03,551 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-23 23:43:03,563 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-23 23:43:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:43:03,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:43:03,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:43:03,821 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 48 treesize of output 52 [2024-11-23 23:43:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691096690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:04,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:43:04,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-23 23:43:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825339855] [2024-11-23 23:43:04,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:43:04,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:43:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:04,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:43:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=393, Unknown=6, NotChecked=0, Total=462 [2024-11-23 23:43:04,005 INFO L87 Difference]: Start difference. First operand 1565 states and 2013 transitions. Second operand has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 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-23 23:43:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:10,847 INFO L93 Difference]: Finished difference Result 1564 states and 2011 transitions. [2024-11-23 23:43:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:43:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 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 88 [2024-11-23 23:43:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:10,860 INFO L225 Difference]: With dead ends: 1564 [2024-11-23 23:43:10,860 INFO L226 Difference]: Without dead ends: 1564 [2024-11-23 23:43:10,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=544, Unknown=6, NotChecked=0, Total=650 [2024-11-23 23:43:10,861 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1146 mSDsluCounter, 8943 mSDsCounter, 0 mSdLazyCounter, 8771 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 9692 SdHoareTripleChecker+Invalid, 8796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:10,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 9692 Invalid, 8796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 8771 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-23 23:43:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-23 23:43:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1555. [2024-11-23 23:43:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1172 states have (on average 1.6851535836177474) internal successors, (1975), 1544 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:43:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1993 transitions. [2024-11-23 23:43:10,898 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1993 transitions. Word has length 88 [2024-11-23 23:43:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:10,898 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 1993 transitions. [2024-11-23 23:43:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.5625) internal successors, (137), 19 states have internal predecessors, (137), 2 states have call successors, (2), 1 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-23 23:43:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1993 transitions. [2024-11-23 23:43:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-23 23:43:10,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:10,903 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] [2024-11-23 23:43:10,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:43:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-23 23:43:11,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:11,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1105810242, now seen corresponding path program 1 times [2024-11-23 23:43:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619708399] [2024-11-23 23:43:11,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:11,934 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-23 23:43:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619708399] [2024-11-23 23:43:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619708399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:43:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:43:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-23 23:43:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865234712] [2024-11-23 23:43:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:43:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:43:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:11,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:43:11,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:43:11,937 INFO L87 Difference]: Start difference. First operand 1555 states and 1993 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:15,331 INFO L93 Difference]: Finished difference Result 1571 states and 2019 transitions. [2024-11-23 23:43:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:43:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-23 23:43:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:15,335 INFO L225 Difference]: With dead ends: 1571 [2024-11-23 23:43:15,336 INFO L226 Difference]: Without dead ends: 1571 [2024-11-23 23:43:15,336 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-23 23:43:15,337 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1175 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 6561 SdHoareTripleChecker+Invalid, 4520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:15,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 6561 Invalid, 4520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-23 23:43:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-23 23:43:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1570. [2024-11-23 23:43:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1186 states have (on average 1.6795952782462058) internal successors, (1992), 1557 states have internal predecessors, (1992), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:43:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2019 transitions. [2024-11-23 23:43:15,366 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2019 transitions. Word has length 90 [2024-11-23 23:43:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:15,367 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2019 transitions. [2024-11-23 23:43:15,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2019 transitions. [2024-11-23 23:43:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-23 23:43:15,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:15,369 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] [2024-11-23 23:43:15,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 23:43:15,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1105810243, now seen corresponding path program 1 times [2024-11-23 23:43:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401425880] [2024-11-23 23:43:15,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:43:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401425880] [2024-11-23 23:43:16,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401425880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:43:16,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:43:16,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:43:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005048410] [2024-11-23 23:43:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:43:16,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:43:16,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:16,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:43:16,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:43:16,443 INFO L87 Difference]: Start difference. First operand 1570 states and 2019 transitions. Second operand has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:19,932 INFO L93 Difference]: Finished difference Result 1570 states and 2017 transitions. [2024-11-23 23:43:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:43:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-23 23:43:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:19,937 INFO L225 Difference]: With dead ends: 1570 [2024-11-23 23:43:19,937 INFO L226 Difference]: Without dead ends: 1570 [2024-11-23 23:43:19,938 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-23 23:43:19,938 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1154 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4583 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:19,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4583 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-23 23:43:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-23 23:43:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-23 23:43:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1186 states have (on average 1.6779089376053964) internal successors, (1990), 1557 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:43:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2017 transitions. [2024-11-23 23:43:19,959 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2017 transitions. Word has length 90 [2024-11-23 23:43:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:19,959 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2017 transitions. [2024-11-23 23:43:19,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2017 transitions. [2024-11-23 23:43:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 23:43:19,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:19,960 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] [2024-11-23 23:43:19,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-23 23:43:19,961 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:19,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1218202601, now seen corresponding path program 1 times [2024-11-23 23:43:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:19,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281241276] [2024-11-23 23:43:19,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:20,790 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-23 23:43:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281241276] [2024-11-23 23:43:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281241276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863267791] [2024-11-23 23:43:20,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:43:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:43:20,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:43:20,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:43:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:21,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-23 23:43:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:43:21,176 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-23 23:43:21,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:43:21,357 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-23 23:43:21,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-23 23:43:21,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:21,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:21,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:21,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:21,570 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-23 23:43:21,574 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-23 23:43:21,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:43:21,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-23 23:43:21,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 23:43:21,691 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-23 23:43:21,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-23 23:43:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863267791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:21,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:43:21,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-23 23:43:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437861542] [2024-11-23 23:43:21,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:43:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 23:43:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:21,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:43:21,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=8, NotChecked=62, Total=342 [2024-11-23 23:43:21,759 INFO L87 Difference]: Start difference. First operand 1570 states and 2017 transitions. Second operand has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (1), 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-23 23:43:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:25,491 INFO L93 Difference]: Finished difference Result 1569 states and 2015 transitions. [2024-11-23 23:43:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:43:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-23 23:43:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:25,495 INFO L225 Difference]: With dead ends: 1569 [2024-11-23 23:43:25,495 INFO L226 Difference]: Without dead ends: 1569 [2024-11-23 23:43:25,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=8, NotChecked=90, Total=650 [2024-11-23 23:43:25,496 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1144 mSDsluCounter, 6540 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 7289 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:25,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 7289 Invalid, 5017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4997 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-23 23:43:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-23 23:43:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-23 23:43:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1186 states have (on average 1.6762225969645868) internal successors, (1988), 1556 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-23 23:43:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2015 transitions. [2024-11-23 23:43:25,519 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2015 transitions. Word has length 91 [2024-11-23 23:43:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:25,519 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2015 transitions. [2024-11-23 23:43:25,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.285714285714286) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (1), 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-23 23:43:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2015 transitions. [2024-11-23 23:43:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 23:43:25,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:25,521 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] [2024-11-23 23:43:25,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 23:43:25,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:43:25,722 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1218202602, now seen corresponding path program 1 times [2024-11-23 23:43:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788194887] [2024-11-23 23:43:25,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:43:26,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788194887] [2024-11-23 23:43:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788194887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415119361] [2024-11-23 23:43:26,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:26,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:43:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:43:26,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:43:26,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:43:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:27,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-23 23:43:27,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:43:27,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-23 23:43:27,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:43:27,432 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-23 23:43:27,440 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-23 23:43:27,482 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-23 23:43:27,487 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-23 23:43:27,626 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-23 23:43:27,633 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-23 23:43:27,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:27,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:27,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:43:27,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:27,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:27,977 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-23 23:43:28,005 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-23 23:43:28,013 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-23 23:43:28,045 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-23 23:43:28,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:43:28,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:43:28,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-23 23:43:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415119361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:28,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:43:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-23 23:43:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125597879] [2024-11-23 23:43:28,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:43:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-23 23:43:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:28,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-23 23:43:28,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=426, Unknown=12, NotChecked=86, Total=600 [2024-11-23 23:43:28,378 INFO L87 Difference]: Start difference. First operand 1569 states and 2015 transitions. Second operand has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 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-23 23:43:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:35,009 INFO L93 Difference]: Finished difference Result 1576 states and 2021 transitions. [2024-11-23 23:43:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:43:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2024-11-23 23:43:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:35,014 INFO L225 Difference]: With dead ends: 1576 [2024-11-23 23:43:35,014 INFO L226 Difference]: Without dead ends: 1576 [2024-11-23 23:43:35,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=631, Unknown=13, NotChecked=106, Total=870 [2024-11-23 23:43:35,015 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1146 mSDsluCounter, 6087 mSDsCounter, 0 mSdLazyCounter, 6727 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:35,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 6841 Invalid, 6749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6727 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-23 23:43:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-23 23:43:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1558. [2024-11-23 23:43:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1176 states have (on average 1.6802721088435375) internal successors, (1976), 1546 states have internal predecessors, (1976), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:43:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1994 transitions. [2024-11-23 23:43:35,034 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1994 transitions. Word has length 91 [2024-11-23 23:43:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:35,035 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 1994 transitions. [2024-11-23 23:43:35,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.411764705882353) internal successors, (143), 20 states have internal predecessors, (143), 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-23 23:43:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1994 transitions. [2024-11-23 23:43:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-23 23:43:35,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:35,036 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] [2024-11-23 23:43:35,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-23 23:43:35,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-23 23:43:35,237 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:35,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash 794382741, now seen corresponding path program 1 times [2024-11-23 23:43:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:35,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302153203] [2024-11-23 23:43:35,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:36,085 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-23 23:43:36,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302153203] [2024-11-23 23:43:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302153203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:43:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:43:36,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-23 23:43:36,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321002383] [2024-11-23 23:43:36,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:43:36,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:43:36,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:36,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:43:36,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:43:36,088 INFO L87 Difference]: Start difference. First operand 1558 states and 1994 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:39,103 INFO L93 Difference]: Finished difference Result 1583 states and 2029 transitions. [2024-11-23 23:43:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:43:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-23 23:43:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:39,110 INFO L225 Difference]: With dead ends: 1583 [2024-11-23 23:43:39,110 INFO L226 Difference]: Without dead ends: 1583 [2024-11-23 23:43:39,111 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-23 23:43:39,112 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1162 mSDsluCounter, 5083 mSDsCounter, 0 mSdLazyCounter, 4034 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5831 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:39,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 5831 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4034 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-23 23:43:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-11-23 23:43:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1579. [2024-11-23 23:43:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1196 states have (on average 1.6714046822742474) internal successors, (1999), 1565 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:43:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2019 transitions. [2024-11-23 23:43:39,138 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2019 transitions. Word has length 93 [2024-11-23 23:43:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:39,138 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2019 transitions. [2024-11-23 23:43:39,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2019 transitions. [2024-11-23 23:43:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-23 23:43:39,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:39,140 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] [2024-11-23 23:43:39,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 23:43:39,140 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:39,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 794382742, now seen corresponding path program 1 times [2024-11-23 23:43:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876110895] [2024-11-23 23:43:39,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:40,260 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-23 23:43:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876110895] [2024-11-23 23:43:40,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876110895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:43:40,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:43:40,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:43:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815233887] [2024-11-23 23:43:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:43:40,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:43:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:40,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:43:40,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:43:40,262 INFO L87 Difference]: Start difference. First operand 1579 states and 2019 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:44,001 INFO L93 Difference]: Finished difference Result 1582 states and 2027 transitions. [2024-11-23 23:43:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 23:43:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-23 23:43:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:44,006 INFO L225 Difference]: With dead ends: 1582 [2024-11-23 23:43:44,007 INFO L226 Difference]: Without dead ends: 1582 [2024-11-23 23:43:44,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-23 23:43:44,008 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1172 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 4212 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:44,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 4433 Invalid, 4231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4212 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-23 23:43:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-23 23:43:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1579. [2024-11-23 23:43:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1196 states have (on average 1.669732441471572) internal successors, (1997), 1565 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:43:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2017 transitions. [2024-11-23 23:43:44,033 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2017 transitions. Word has length 93 [2024-11-23 23:43:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:44,033 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2017 transitions. [2024-11-23 23:43:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:43:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2017 transitions. [2024-11-23 23:43:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-23 23:43:44,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:44,035 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-23 23:43:44,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 23:43:44,036 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:44,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -999341170, now seen corresponding path program 1 times [2024-11-23 23:43:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015590370] [2024-11-23 23:43:44,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:43:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015590370] [2024-11-23 23:43:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015590370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:45,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456831373] [2024-11-23 23:43:45,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:43:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:43:45,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:43:45,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:43:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:45,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-23 23:43:45,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:43:45,526 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-23 23:43:45,685 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:43:45,685 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-23 23:43:45,702 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-23 23:43:45,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:45,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:43:45,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:45,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 42 treesize of output 41 [2024-11-23 23:43:46,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:46,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:46,067 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-23 23:43:46,072 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-23 23:43:46,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:43:46,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-23 23:43:46,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 23:43:46,278 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-23 23:43:46,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-23 23:43:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456831373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:46,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:43:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2024-11-23 23:43:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319981065] [2024-11-23 23:43:46,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:43:46,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:43:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:46,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:43:46,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=376, Unknown=24, NotChecked=82, Total=552 [2024-11-23 23:43:46,361 INFO L87 Difference]: Start difference. First operand 1579 states and 2017 transitions. Second operand has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:43:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:43:51,640 INFO L93 Difference]: Finished difference Result 1581 states and 2025 transitions. [2024-11-23 23:43:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:43:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-23 23:43:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:43:51,651 INFO L225 Difference]: With dead ends: 1581 [2024-11-23 23:43:51,651 INFO L226 Difference]: Without dead ends: 1581 [2024-11-23 23:43:51,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=716, Unknown=24, NotChecked=114, Total=992 [2024-11-23 23:43:51,653 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1142 mSDsluCounter, 9444 mSDsCounter, 0 mSdLazyCounter, 7004 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 10192 SdHoareTripleChecker+Invalid, 7024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:43:51,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 10192 Invalid, 7024 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7004 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-23 23:43:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-23 23:43:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1578. [2024-11-23 23:43:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1196 states have (on average 1.6680602006688963) internal successors, (1995), 1564 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:43:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2015 transitions. [2024-11-23 23:43:51,682 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2015 transitions. Word has length 94 [2024-11-23 23:43:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:43:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2015 transitions. [2024-11-23 23:43:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.294117647058824) internal successors, (141), 19 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:43:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2015 transitions. [2024-11-23 23:43:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-23 23:43:51,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:43:51,688 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-23 23:43:51,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 23:43:51,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-23 23:43:51,896 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:43:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:43:51,905 INFO L85 PathProgramCache]: Analyzing trace with hash -999341169, now seen corresponding path program 1 times [2024-11-23 23:43:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:43:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038058866] [2024-11-23 23:43:51,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:43:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:53,423 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-23 23:43:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:43:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038058866] [2024-11-23 23:43:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038058866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020914055] [2024-11-23 23:43:53,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:43:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:43:53,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:43:53,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:43:53,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:43:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:43:53,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-23 23:43:53,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:43:53,834 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-23 23:43:53,988 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-23 23:43:54,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:43:54,003 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-23 23:43:54,017 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-23 23:43:54,025 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-23 23:43:54,099 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-23 23:43:54,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-23 23:43:54,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:54,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:54,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:43:54,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:54,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-23 23:43:54,389 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-23 23:43:54,524 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:43:54,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:43:54,530 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-23 23:43:54,554 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-23 23:43:54,560 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-23 23:43:54,562 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-23 23:43:54,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:43:54,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-23 23:43:54,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-23 23:43:54,768 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-23 23:43:54,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse0 v_ArrVal_1453) (select (select (store .cse1 .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1452))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1453) .cse4 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-23 23:43:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020914055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:43:54,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:43:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-23 23:43:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465325265] [2024-11-23 23:43:54,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:43:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:43:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:43:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:43:54,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=348, Unknown=12, NotChecked=164, Total=600 [2024-11-23 23:43:54,874 INFO L87 Difference]: Start difference. First operand 1578 states and 2015 transitions. Second operand has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:44:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:02,877 INFO L93 Difference]: Finished difference Result 1580 states and 2023 transitions. [2024-11-23 23:44:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:44:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-23 23:44:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:02,882 INFO L225 Difference]: With dead ends: 1580 [2024-11-23 23:44:02,882 INFO L226 Difference]: Without dead ends: 1580 [2024-11-23 23:44:02,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=584, Unknown=12, NotChecked=212, Total=930 [2024-11-23 23:44:02,884 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1142 mSDsluCounter, 7706 mSDsCounter, 0 mSdLazyCounter, 8733 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 8459 SdHoareTripleChecker+Invalid, 8754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 8733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:02,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 8459 Invalid, 8754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 8733 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-23 23:44:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-23 23:44:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1556. [2024-11-23 23:44:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1176 states have (on average 1.6768707482993197) internal successors, (1972), 1544 states have internal predecessors, (1972), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1990 transitions. [2024-11-23 23:44:02,908 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1990 transitions. Word has length 94 [2024-11-23 23:44:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1990 transitions. [2024-11-23 23:44:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:44:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1990 transitions. [2024-11-23 23:44:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-23 23:44:02,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:02,911 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] [2024-11-23 23:44:02,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:44:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-23 23:44:03,112 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:03,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 187066761, now seen corresponding path program 1 times [2024-11-23 23:44:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641948192] [2024-11-23 23:44:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:04,138 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-23 23:44:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641948192] [2024-11-23 23:44:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641948192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-23 23:44:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847550036] [2024-11-23 23:44:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:04,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 23:44:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:04,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:44:04,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:44:04,145 INFO L87 Difference]: Start difference. First operand 1556 states and 1990 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:07,344 INFO L93 Difference]: Finished difference Result 1587 states and 2031 transitions. [2024-11-23 23:44:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:44:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-23 23:44:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:07,349 INFO L225 Difference]: With dead ends: 1587 [2024-11-23 23:44:07,349 INFO L226 Difference]: Without dead ends: 1587 [2024-11-23 23:44:07,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-23 23:44:07,351 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1175 mSDsluCounter, 5110 mSDsCounter, 0 mSdLazyCounter, 4043 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 5857 SdHoareTripleChecker+Invalid, 4063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:07,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 5857 Invalid, 4063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4043 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-23 23:44:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-11-23 23:44:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1583. [2024-11-23 23:44:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1202 states have (on average 1.6647254575707155) internal successors, (2001), 1569 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:44:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2021 transitions. [2024-11-23 23:44:07,377 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2021 transitions. Word has length 96 [2024-11-23 23:44:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:07,377 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2021 transitions. [2024-11-23 23:44:07,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2021 transitions. [2024-11-23 23:44:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-23 23:44:07,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:07,379 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] [2024-11-23 23:44:07,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-23 23:44:07,380 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:07,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 187066762, now seen corresponding path program 1 times [2024-11-23 23:44:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:07,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842572780] [2024-11-23 23:44:07,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:08,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-23 23:44:08,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842572780] [2024-11-23 23:44:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842572780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:08,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-23 23:44:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854843759] [2024-11-23 23:44:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:44:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:08,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:44:08,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:44:08,519 INFO L87 Difference]: Start difference. First operand 1583 states and 2021 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:11,847 INFO L93 Difference]: Finished difference Result 1586 states and 2029 transitions. [2024-11-23 23:44:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:44:11,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-23 23:44:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:11,851 INFO L225 Difference]: With dead ends: 1586 [2024-11-23 23:44:11,851 INFO L226 Difference]: Without dead ends: 1586 [2024-11-23 23:44:11,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:44:11,852 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1156 mSDsluCounter, 3833 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:11,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 4587 Invalid, 4060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4041 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-23 23:44:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-23 23:44:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1583. [2024-11-23 23:44:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1202 states have (on average 1.6630615640599002) internal successors, (1999), 1569 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:44:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2019 transitions. [2024-11-23 23:44:11,883 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2019 transitions. Word has length 96 [2024-11-23 23:44:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2019 transitions. [2024-11-23 23:44:11,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:44:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2019 transitions. [2024-11-23 23:44:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-23 23:44:11,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:11,885 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-23 23:44:11,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-23 23:44:11,885 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:11,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1341130992, now seen corresponding path program 1 times [2024-11-23 23:44:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025474187] [2024-11-23 23:44:11,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:12,739 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-23 23:44:12,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:12,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025474187] [2024-11-23 23:44:12,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025474187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063854108] [2024-11-23 23:44:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:12,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:44:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:12,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:44:12,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:44:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:13,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-23 23:44:13,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:44:13,170 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-23 23:44:13,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:13,313 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-23 23:44:13,323 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-23 23:44:13,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:13,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:13,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:13,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:13,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:13,649 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:13,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:44:13,672 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-23 23:44:13,677 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-23 23:44:13,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:44:13,694 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-23 23:44:13,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-23 23:44:13,720 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-23 23:44:13,864 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-23 23:44:13,933 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-23 23:44:13,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-23 23:44:13,944 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-23 23:44:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063854108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:13,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:44:13,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-23 23:44:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414040072] [2024-11-23 23:44:13,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:44:13,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-23 23:44:13,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:13,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 23:44:13,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=461, Unknown=21, NotChecked=240, Total=812 [2024-11-23 23:44:13,950 INFO L87 Difference]: Start difference. First operand 1583 states and 2019 transitions. Second operand has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 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-23 23:44:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:17,964 INFO L93 Difference]: Finished difference Result 1585 states and 2027 transitions. [2024-11-23 23:44:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:44:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-23 23:44:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:17,967 INFO L225 Difference]: With dead ends: 1585 [2024-11-23 23:44:17,967 INFO L226 Difference]: Without dead ends: 1585 [2024-11-23 23:44:17,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=886, Unknown=21, NotChecked=330, Total=1406 [2024-11-23 23:44:17,968 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1140 mSDsluCounter, 6560 mSDsCounter, 0 mSdLazyCounter, 5020 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 7307 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:17,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 7307 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5020 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-23 23:44:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-23 23:44:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1582. [2024-11-23 23:44:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1202 states have (on average 1.661397670549085) internal successors, (1997), 1568 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:44:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2017 transitions. [2024-11-23 23:44:17,994 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2017 transitions. Word has length 97 [2024-11-23 23:44:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:17,995 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2017 transitions. [2024-11-23 23:44:17,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 1 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-23 23:44:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2017 transitions. [2024-11-23 23:44:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-23 23:44:17,996 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:17,996 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-23 23:44:18,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:44:18,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-23 23:44:18,197 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:18,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1341130993, now seen corresponding path program 1 times [2024-11-23 23:44:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661687501] [2024-11-23 23:44:18,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:19,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-23 23:44:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661687501] [2024-11-23 23:44:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661687501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228181683] [2024-11-23 23:44:19,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:44:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:19,609 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:44:19,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:44:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:19,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-23 23:44:19,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:44:20,005 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-23 23:44:20,167 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-23 23:44:20,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:20,179 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-23 23:44:20,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-23 23:44:20,199 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-23 23:44:20,279 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-23 23:44:20,285 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-23 23:44:20,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:20,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:20,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:44:20,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:20,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:20,571 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-23 23:44:20,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:20,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:20,651 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-23 23:44:20,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:20,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:20,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:44:20,763 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-23 23:44:20,773 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-23 23:44:20,776 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-23 23:44:20,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:44:20,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:44:20,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-23 23:44:20,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-23 23:44:20,919 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-23 23:44:20,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-23 23:44:20,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-23 23:44:21,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-23 23:44:21,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228181683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:21,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:44:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-23 23:44:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444896826] [2024-11-23 23:44:21,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:44:21,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-23 23:44:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:21,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-23 23:44:21,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2024-11-23 23:44:21,196 INFO L87 Difference]: Start difference. First operand 1582 states and 2017 transitions. Second operand has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:44:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:29,982 INFO L93 Difference]: Finished difference Result 1584 states and 2025 transitions. [2024-11-23 23:44:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:44:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-23 23:44:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:29,985 INFO L225 Difference]: With dead ends: 1584 [2024-11-23 23:44:29,985 INFO L226 Difference]: Without dead ends: 1584 [2024-11-23 23:44:29,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2024-11-23 23:44:29,986 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1141 mSDsluCounter, 8407 mSDsCounter, 0 mSdLazyCounter, 9234 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 9159 SdHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:29,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 9159 Invalid, 9256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 9234 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-23 23:44:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-23 23:44:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1554. [2024-11-23 23:44:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1176 states have (on average 1.6734693877551021) internal successors, (1968), 1542 states have internal predecessors, (1968), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:44:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1986 transitions. [2024-11-23 23:44:30,009 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1986 transitions. Word has length 97 [2024-11-23 23:44:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 1986 transitions. [2024-11-23 23:44:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:44:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1986 transitions. [2024-11-23 23:44:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-23 23:44:30,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:30,011 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-23 23:44:30,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-23 23:44:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-23 23:44:30,212 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash -662564405, now seen corresponding path program 1 times [2024-11-23 23:44:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780816394] [2024-11-23 23:44:30,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:31,169 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-23 23:44:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780816394] [2024-11-23 23:44:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780816394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-23 23:44:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113246819] [2024-11-23 23:44:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:31,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:44:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:31,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:44:31,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-23 23:44:31,171 INFO L87 Difference]: Start difference. First operand 1554 states and 1986 transitions. Second operand has 14 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-23 23:44:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:35,039 INFO L93 Difference]: Finished difference Result 1593 states and 2035 transitions. [2024-11-23 23:44:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:44:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 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-23 23:44:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:35,042 INFO L225 Difference]: With dead ends: 1593 [2024-11-23 23:44:35,042 INFO L226 Difference]: Without dead ends: 1593 [2024-11-23 23:44:35,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-23 23:44:35,043 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1160 mSDsluCounter, 5067 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 5819 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:35,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 5819 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-23 23:44:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2024-11-23 23:44:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1589. [2024-11-23 23:44:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1210 states have (on average 1.6570247933884297) internal successors, (2005), 1575 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:44:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2025 transitions. [2024-11-23 23:44:35,065 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2025 transitions. Word has length 100 [2024-11-23 23:44:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:35,066 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2025 transitions. [2024-11-23 23:44:35,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 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-23 23:44:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2025 transitions. [2024-11-23 23:44:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-23 23:44:35,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:35,067 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-23 23:44:35,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-23 23:44:35,068 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:35,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -662564404, now seen corresponding path program 1 times [2024-11-23 23:44:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847418115] [2024-11-23 23:44:35,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:37,044 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-23 23:44:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847418115] [2024-11-23 23:44:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847418115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:44:37,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:44:37,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-23 23:44:37,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324746034] [2024-11-23 23:44:37,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:44:37,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:44:37,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:37,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:44:37,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:44:37,047 INFO L87 Difference]: Start difference. First operand 1589 states and 2025 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 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-23 23:44:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:44,558 INFO L93 Difference]: Finished difference Result 1592 states and 2033 transitions. [2024-11-23 23:44:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:44:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 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-23 23:44:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:44,561 INFO L225 Difference]: With dead ends: 1592 [2024-11-23 23:44:44,561 INFO L226 Difference]: Without dead ends: 1592 [2024-11-23 23:44:44,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-23 23:44:44,563 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1156 mSDsluCounter, 6382 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 7129 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:44,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 7129 Invalid, 7660 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-23 23:44:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-23 23:44:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1589. [2024-11-23 23:44:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1210 states have (on average 1.6553719008264463) internal successors, (2003), 1575 states have internal predecessors, (2003), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:44:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2023 transitions. [2024-11-23 23:44:44,590 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2023 transitions. Word has length 100 [2024-11-23 23:44:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:44,591 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2023 transitions. [2024-11-23 23:44:44,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 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-23 23:44:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2023 transitions. [2024-11-23 23:44:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-23 23:44:44,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:44,592 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-23 23:44:44,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-23 23:44:44,593 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643250, now seen corresponding path program 1 times [2024-11-23 23:44:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:44,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818451209] [2024-11-23 23:44:44,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:45,880 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-23 23:44:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818451209] [2024-11-23 23:44:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818451209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144916771] [2024-11-23 23:44:45,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:45,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:44:45,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:45,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:44:45,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:44:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:46,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-23 23:44:46,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:44:46,312 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-23 23:44:46,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:46,502 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-23 23:44:46,510 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-23 23:44:46,652 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:46,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:46,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:46,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:44:46,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:46,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:46,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:46,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:46,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:46,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-23 23:44:46,952 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-23 23:44:46,990 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:44:46,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-23 23:44:46,995 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-23 23:44:46,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:44:48,186 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-23 23:44:48,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-23 23:44:48,209 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2271))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2264)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-23 23:44:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144916771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:48,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:44:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-23 23:44:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974340636] [2024-11-23 23:44:48,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:44:48,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-23 23:44:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:44:48,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 23:44:48,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=934, Unknown=44, NotChecked=64, Total=1190 [2024-11-23 23:44:48,214 INFO L87 Difference]: Start difference. First operand 1589 states and 2023 transitions. Second operand has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 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-23 23:44:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:44:53,396 INFO L93 Difference]: Finished difference Result 1591 states and 2031 transitions. [2024-11-23 23:44:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:44:53,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 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-23 23:44:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:44:53,399 INFO L225 Difference]: With dead ends: 1591 [2024-11-23 23:44:53,400 INFO L226 Difference]: Without dead ends: 1591 [2024-11-23 23:44:53,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=270, Invalid=1582, Unknown=44, NotChecked=84, Total=1980 [2024-11-23 23:44:53,401 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1143 mSDsluCounter, 8016 mSDsCounter, 0 mSdLazyCounter, 6016 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 8762 SdHoareTripleChecker+Invalid, 6039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:44:53,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 8762 Invalid, 6039 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6016 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-23 23:44:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-11-23 23:44:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1588. [2024-11-23 23:44:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1210 states have (on average 1.6537190082644628) internal successors, (2001), 1574 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:44:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2021 transitions. [2024-11-23 23:44:53,423 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2021 transitions. Word has length 101 [2024-11-23 23:44:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:44:53,424 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2021 transitions. [2024-11-23 23:44:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 2 states have call successors, (2), 1 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-23 23:44:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2021 transitions. [2024-11-23 23:44:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-23 23:44:53,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:44:53,425 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-23 23:44:53,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-23 23:44:53,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-23 23:44:53,626 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:44:53,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:44:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1460643251, now seen corresponding path program 1 times [2024-11-23 23:44:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:44:53,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679576488] [2024-11-23 23:44:53,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:53,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:44:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:55,361 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-23 23:44:55,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:44:55,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679576488] [2024-11-23 23:44:55,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679576488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:44:55,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184812196] [2024-11-23 23:44:55,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:44:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:44:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:44:55,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:44:55,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 23:44:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:44:55,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-23 23:44:55,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:44:55,788 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-23 23:44:55,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:55,986 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-23 23:44:55,995 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-23 23:44:56,037 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-23 23:44:56,041 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-23 23:44:56,194 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-23 23:44:56,199 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-23 23:44:56,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:56,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-23 23:44:56,432 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-23 23:44:56,605 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:56,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:56,611 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-23 23:44:56,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:56,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-23 23:44:56,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-23 23:44:56,890 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:56,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:44:56,898 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-23 23:44:57,039 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:44:57,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-23 23:44:57,048 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-23 23:44:57,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-23 23:44:57,096 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-23 23:44:57,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:44:57,188 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-23 23:44:57,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-23 23:44:57,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:44:57,204 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-23 23:44:57,242 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-23 23:44:57,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:44:59,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2450))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse1 v_ArrVal_2451) .cse2 v_ArrVal_2453) (select (select (store .cse3 .cse2 v_ArrVal_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2455))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2456 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2450))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2452))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse6 v_ArrVal_2451) .cse7 v_ArrVal_2453) .cse8 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse9 .cse8 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-23 23:44:59,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:44:59,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-23 23:45:00,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_23))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_17))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_26))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) .cse0 v_prenex_18) .cse1 v_prenex_24) .cse2 v_prenex_21) (select (select (store .cse3 .cse2 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_19))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2456 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2449))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2450))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2452))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2461) .cse7 v_ArrVal_2448) .cse8 v_ArrVal_2451) .cse9 v_ArrVal_2453) .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse11 .cse10 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))))) is different from false [2024-11-23 23:45:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184812196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:00,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-23 23:45:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181029461] [2024-11-23 23:45:00,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:00,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-23 23:45:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:00,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 23:45:00,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1498, Unknown=44, NotChecked=162, Total=1892 [2024-11-23 23:45:00,426 INFO L87 Difference]: Start difference. First operand 1588 states and 2021 transitions. Second operand has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 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-23 23:45:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:15,111 INFO L93 Difference]: Finished difference Result 1590 states and 2029 transitions. [2024-11-23 23:45:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-23 23:45:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 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-23 23:45:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:15,113 INFO L225 Difference]: With dead ends: 1590 [2024-11-23 23:45:15,113 INFO L226 Difference]: Without dead ends: 1590 [2024-11-23 23:45:15,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=324, Invalid=2292, Unknown=44, NotChecked=202, Total=2862 [2024-11-23 23:45:15,114 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1147 mSDsluCounter, 8746 mSDsCounter, 0 mSdLazyCounter, 10137 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 9491 SdHoareTripleChecker+Invalid, 10166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:15,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 9491 Invalid, 10166 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 10137 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-23 23:45:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-23 23:45:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1552. [2024-11-23 23:45:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1176 states have (on average 1.6700680272108843) internal successors, (1964), 1540 states have internal predecessors, (1964), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:45:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1982 transitions. [2024-11-23 23:45:15,135 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1982 transitions. Word has length 101 [2024-11-23 23:45:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 1982 transitions. [2024-11-23 23:45:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.620689655172414) internal successors, (163), 30 states have internal predecessors, (163), 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-23 23:45:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1982 transitions. [2024-11-23 23:45:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-23 23:45:15,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:15,137 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-23 23:45:15,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-23 23:45:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-23 23:45:15,339 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:15,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1214148546, now seen corresponding path program 1 times [2024-11-23 23:45:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:15,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127169961] [2024-11-23 23:45:15,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:16,405 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-23 23:45:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:16,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127169961] [2024-11-23 23:45:16,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127169961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:16,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-23 23:45:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100216397] [2024-11-23 23:45:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:16,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:45:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:16,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:45:16,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:45:16,408 INFO L87 Difference]: Start difference. First operand 1552 states and 1982 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 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-23 23:45:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:21,376 INFO L93 Difference]: Finished difference Result 1597 states and 2037 transitions. [2024-11-23 23:45:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 23:45:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 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-23 23:45:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:21,378 INFO L225 Difference]: With dead ends: 1597 [2024-11-23 23:45:21,378 INFO L226 Difference]: Without dead ends: 1597 [2024-11-23 23:45:21,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-23 23:45:21,379 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1178 mSDsluCounter, 5847 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6598 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:21,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6598 Invalid, 4532 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 4512 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-23 23:45:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2024-11-23 23:45:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1593. [2024-11-23 23:45:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1216 states have (on average 1.6504934210526316) internal successors, (2007), 1579 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2027 transitions. [2024-11-23 23:45:21,396 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2027 transitions. Word has length 103 [2024-11-23 23:45:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:21,396 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2027 transitions. [2024-11-23 23:45:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 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-23 23:45:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2027 transitions. [2024-11-23 23:45:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-23 23:45:21,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:21,397 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-23 23:45:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-23 23:45:21,397 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1214148547, now seen corresponding path program 1 times [2024-11-23 23:45:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254558926] [2024-11-23 23:45:21,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:23,293 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-23 23:45:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254558926] [2024-11-23 23:45:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254558926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:23,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-23 23:45:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690754176] [2024-11-23 23:45:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:23,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:45:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:23,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:45:23,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:45:23,297 INFO L87 Difference]: Start difference. First operand 1593 states and 2027 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 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-23 23:45:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:30,426 INFO L93 Difference]: Finished difference Result 1596 states and 2035 transitions. [2024-11-23 23:45:30,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:45:30,426 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 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-23 23:45:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:30,428 INFO L225 Difference]: With dead ends: 1596 [2024-11-23 23:45:30,428 INFO L226 Difference]: Without dead ends: 1596 [2024-11-23 23:45:30,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-23 23:45:30,429 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1157 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 5922 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 6393 SdHoareTripleChecker+Invalid, 5944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:30,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 6393 Invalid, 5944 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5922 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-23 23:45:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-23 23:45:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1593. [2024-11-23 23:45:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1216 states have (on average 1.6488486842105263) internal successors, (2005), 1579 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2025 transitions. [2024-11-23 23:45:30,445 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2025 transitions. Word has length 103 [2024-11-23 23:45:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:30,445 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2025 transitions. [2024-11-23 23:45:30,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 18 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-23 23:45:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2025 transitions. [2024-11-23 23:45:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-23 23:45:30,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:30,446 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-23 23:45:30,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-23 23:45:30,446 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1710030459, now seen corresponding path program 1 times [2024-11-23 23:45:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141612373] [2024-11-23 23:45:30,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:45:30,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:30,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141612373] [2024-11-23 23:45:30,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141612373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:45:30,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:45:30,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:45:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871036928] [2024-11-23 23:45:30,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:45:30,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:45:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:45:30,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:45:30,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:45:30,796 INFO L87 Difference]: Start difference. First operand 1593 states and 2025 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:45:32,748 INFO L93 Difference]: Finished difference Result 1592 states and 2023 transitions. [2024-11-23 23:45:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:45:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-23 23:45:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:45:32,752 INFO L225 Difference]: With dead ends: 1592 [2024-11-23 23:45:32,752 INFO L226 Difference]: Without dead ends: 1592 [2024-11-23 23:45:32,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:45:32,753 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 2 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3711 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:45:32,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3711 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-23 23:45:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-23 23:45:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-23 23:45:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1216 states have (on average 1.647203947368421) internal successors, (2003), 1578 states have internal predecessors, (2003), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:45:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2023 transitions. [2024-11-23 23:45:32,777 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2023 transitions. Word has length 104 [2024-11-23 23:45:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:45:32,778 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2023 transitions. [2024-11-23 23:45:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:45:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2023 transitions. [2024-11-23 23:45:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-23 23:45:32,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:45:32,779 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-23 23:45:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-23 23:45:32,780 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:45:32,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:45:32,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1710030460, now seen corresponding path program 1 times [2024-11-23 23:45:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:45:32,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85463439] [2024-11-23 23:45:32,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:32,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:45:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:34,775 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-23 23:45:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:45:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85463439] [2024-11-23 23:45:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85463439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:45:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925452526] [2024-11-23 23:45:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:45:34,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:45:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:45:34,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:45:34,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 23:45:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:45:35,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-23 23:45:35,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:45:35,249 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-23 23:45:35,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:35,432 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-23 23:45:35,440 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-23 23:45:35,448 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-23 23:45:35,457 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-23 23:45:35,560 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-23 23:45:35,569 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-23 23:45:35,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:35,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:35,876 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-23 23:45:36,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:36,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:36,065 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-23 23:45:36,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:36,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:36,204 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-23 23:45:36,343 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:36,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:36,349 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-23 23:45:36,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:36,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:36,494 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-23 23:45:36,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:45:36,590 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-23 23:45:36,603 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:45:36,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 23:45:36,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:45:36,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:45:36,652 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-23 23:45:36,688 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-23 23:45:36,694 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-23 23:45:36,703 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-23 23:45:36,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:45:36,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2918 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:45:39,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2911))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2913))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2912) .cse0 v_ArrVal_2914) .cse1 v_ArrVal_2916) (select (select (store .cse2 .cse1 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2917 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2911))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2913))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2915))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2912) .cse5 v_ArrVal_2914) .cse6 v_ArrVal_2916) .cse7 v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2917) (select (select (store .cse8 .cse7 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-23 23:45:39,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2911))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2913))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2912) .cse1 v_ArrVal_2914) .cse2 v_ArrVal_2916) (select (select (store .cse3 .cse2 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)))) (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (forall ((v_ArrVal_2917 Int) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2911))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2913))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2915))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2912) .cse6 v_ArrVal_2914) .cse7 v_ArrVal_2916) .cse8 v_ArrVal_2918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2917) (select (select (store .cse9 .cse8 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-23 23:46:18,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:46:18,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1180 treesize of output 1198 [2024-11-23 23:46:20,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2924 (Array Int Int)) (v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2916 (Array Int Int)) (v_ArrVal_2915 (Array Int Int)) (v_ArrVal_2925 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2924))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2910))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2911))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2913))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2925) .cse0 v_ArrVal_2909) .cse1 v_ArrVal_2912) .cse2 v_ArrVal_2914) .cse3 v_ArrVal_2916) (select (select (store .cse4 .cse3 v_ArrVal_2915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_2918))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((v_ArrVal_2917 Int) (v_prenex_32 Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_32) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_27))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_prenex_31))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_prenex_30))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_prenex_28))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_prenex_36))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ 43 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_37) .cse9 v_prenex_33) .cse10 v_prenex_29) .cse11 v_prenex_38) .cse12 v_prenex_35) .cse13 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| v_prenex_32 v_ArrVal_2917) (select (select (store .cse14 .cse13 v_ArrVal_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-11-23 23:46:20,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925452526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:46:20,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:46:20,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 26 [2024-11-23 23:46:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491502494] [2024-11-23 23:46:20,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:46:20,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-23 23:46:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:46:20,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-23 23:46:20,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1100, Unknown=57, NotChecked=292, Total=1640 [2024-11-23 23:46:20,622 INFO L87 Difference]: Start difference. First operand 1592 states and 2023 transitions. Second operand has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:25,385 INFO L93 Difference]: Finished difference Result 1594 states and 2031 transitions. [2024-11-23 23:47:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-23 23:47:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2024-11-23 23:47:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:25,387 INFO L225 Difference]: With dead ends: 1594 [2024-11-23 23:47:25,387 INFO L226 Difference]: Without dead ends: 1594 [2024-11-23 23:47:25,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=330, Invalid=1885, Unknown=57, NotChecked=380, Total=2652 [2024-11-23 23:47:25,388 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1141 mSDsluCounter, 6050 mSDsCounter, 0 mSdLazyCounter, 6788 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 6794 SdHoareTripleChecker+Invalid, 6812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:25,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 6794 Invalid, 6812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6788 Invalid, 0 Unknown, 0 Unchecked, 61.7s Time] [2024-11-23 23:47:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-11-23 23:47:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1550. [2024-11-23 23:47:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1176 states have (on average 1.6666666666666667) internal successors, (1960), 1538 states have internal predecessors, (1960), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:47:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1978 transitions. [2024-11-23 23:47:25,406 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1978 transitions. Word has length 104 [2024-11-23 23:47:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:25,407 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 1978 transitions. [2024-11-23 23:47:25,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1978 transitions. [2024-11-23 23:47:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-23 23:47:25,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:25,408 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] [2024-11-23 23:47:25,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-23 23:47:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-23 23:47:25,609 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:47:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1514580590, now seen corresponding path program 1 times [2024-11-23 23:47:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247093976] [2024-11-23 23:47:25,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:28,902 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-23 23:47:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247093976] [2024-11-23 23:47:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247093976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:28,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-23 23:47:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482153448] [2024-11-23 23:47:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:28,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-23 23:47:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:28,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 23:47:28,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-23 23:47:28,904 INFO L87 Difference]: Start difference. First operand 1550 states and 1978 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:48:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:23,584 INFO L93 Difference]: Finished difference Result 1635 states and 2087 transitions. [2024-11-23 23:48:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:48:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-23 23:48:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:23,586 INFO L225 Difference]: With dead ends: 1635 [2024-11-23 23:48:23,586 INFO L226 Difference]: Without dead ends: 1635 [2024-11-23 23:48:23,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-23 23:48:23,587 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 1188 mSDsluCounter, 8067 mSDsCounter, 0 mSdLazyCounter, 6131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 8824 SdHoareTripleChecker+Invalid, 6153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:23,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 8824 Invalid, 6153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6131 Invalid, 0 Unknown, 0 Unchecked, 52.9s Time] [2024-11-23 23:48:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-23 23:48:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1597. [2024-11-23 23:48:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1222 states have (on average 1.6440261865793782) internal successors, (2009), 1583 states have internal predecessors, (2009), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:48:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2029 transitions. [2024-11-23 23:48:23,622 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2029 transitions. Word has length 106 [2024-11-23 23:48:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:23,622 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2029 transitions. [2024-11-23 23:48:23,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:48:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2029 transitions. [2024-11-23 23:48:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-23 23:48:23,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:23,623 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] [2024-11-23 23:48:23,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-23 23:48:23,623 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:48:23,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1514580589, now seen corresponding path program 1 times [2024-11-23 23:48:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460756121] [2024-11-23 23:48:23,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:27,288 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-23 23:48:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460756121] [2024-11-23 23:48:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460756121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:27,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-23 23:48:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190297389] [2024-11-23 23:48:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:27,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 23:48:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:27,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:48:27,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:48:27,290 INFO L87 Difference]: Start difference. First operand 1597 states and 2029 transitions. Second operand has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:49:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:28,675 INFO L93 Difference]: Finished difference Result 1634 states and 2085 transitions. [2024-11-23 23:49:28,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:49:28,676 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-23 23:49:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:28,678 INFO L225 Difference]: With dead ends: 1634 [2024-11-23 23:49:28,678 INFO L226 Difference]: Without dead ends: 1634 [2024-11-23 23:49:28,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-23 23:49:28,679 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1207 mSDsluCounter, 8405 mSDsCounter, 0 mSdLazyCounter, 6953 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 9158 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:28,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 9158 Invalid, 6976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 6953 Invalid, 0 Unknown, 0 Unchecked, 59.5s Time] [2024-11-23 23:49:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-23 23:49:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1597. [2024-11-23 23:49:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1222 states have (on average 1.6423895253682488) internal successors, (2007), 1583 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:49:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2027 transitions. [2024-11-23 23:49:28,705 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2027 transitions. Word has length 106 [2024-11-23 23:49:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2027 transitions. [2024-11-23 23:49:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:49:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2027 transitions. [2024-11-23 23:49:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-23 23:49:28,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:28,707 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-23 23:49:28,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-23 23:49:28,707 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:49:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 910958649, now seen corresponding path program 1 times [2024-11-23 23:49:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572058472] [2024-11-23 23:49:28,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:49:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572058472] [2024-11-23 23:49:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572058472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:49:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:49:33,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-23 23:49:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306240498] [2024-11-23 23:49:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:49:33,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:49:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:33,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:49:33,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:49:33,299 INFO L87 Difference]: Start difference. First operand 1597 states and 2027 transitions. Second operand has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 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-23 23:50:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:12,471 INFO L93 Difference]: Finished difference Result 1596 states and 2025 transitions. [2024-11-23 23:50:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:50:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 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-23 23:50:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:50:12,474 INFO L225 Difference]: With dead ends: 1596 [2024-11-23 23:50:12,474 INFO L226 Difference]: Without dead ends: 1596 [2024-11-23 23:50:12,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-23 23:50:12,475 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 3424 mSDsluCounter, 5803 mSDsCounter, 0 mSdLazyCounter, 4469 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 4503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:50:12,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 6557 Invalid, 4503 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 4469 Invalid, 0 Unknown, 0 Unchecked, 37.5s Time] [2024-11-23 23:50:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-23 23:50:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2024-11-23 23:50:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1222 states have (on average 1.6407528641571194) internal successors, (2005), 1582 states have internal predecessors, (2005), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:50:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2025 transitions. [2024-11-23 23:50:12,488 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2025 transitions. Word has length 107 [2024-11-23 23:50:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:50:12,489 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2025 transitions. [2024-11-23 23:50:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.75) internal successors, (105), 13 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-23 23:50:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2025 transitions. [2024-11-23 23:50:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-23 23:50:12,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:50:12,489 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-23 23:50:12,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-23 23:50:12,490 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:50:12,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash 910958650, now seen corresponding path program 1 times [2024-11-23 23:50:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:50:12,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823039055] [2024-11-23 23:50:12,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:12,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:16,694 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-23 23:50:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:50:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823039055] [2024-11-23 23:50:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823039055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121145616] [2024-11-23 23:50:16,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:16,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:16,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:16,697 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:16,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 23:50:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:17,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-23 23:50:17,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:17,187 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-23 23:50:18,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 23:50:18,358 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-23 23:50:18,393 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-23 23:50:18,410 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-23 23:50:18,981 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:18,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:50:18,999 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-23 23:50:19,522 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:19,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:50:19,540 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-23 23:50:20,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:20,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:50:20,060 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-23 23:50:20,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:20,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 51 treesize of output 48 [2024-11-23 23:50:20,594 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-23 23:50:21,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:21,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:50:21,143 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-23 23:50:21,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:21,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:50:21,820 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-23 23:50:22,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-23 23:50:22,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 23:50:22,867 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-23 23:50:22,987 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-23 23:50:23,005 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-23 23:50:23,312 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-23 23:50:23,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:24,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3412 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-23 23:50:24,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3412 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-23 23:50:24,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 23:50:24,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 84 [2024-11-23 23:50:24,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3410) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-23 23:50:24,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3410) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3409))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-23 23:50:24,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3408))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3407) .cse6 v_ArrVal_3410) (select (select (store .cse7 .cse6 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) is different from false [2024-11-23 23:50:24,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3407) .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3407) .cse4 v_ArrVal_3410) (select (select (store .cse5 .cse4 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3412))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3408))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_3409))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8))))))) is different from false [2024-11-23 23:50:24,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3408)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3408))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3405) .cse5 v_ArrVal_3407) .cse6 v_prenex_40) (select (select (store .cse7 .cse6 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3406))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3408))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3405) .cse9 v_ArrVal_3407) .cse10 v_ArrVal_3410) (select (select (store .cse11 .cse10 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) is different from false [2024-11-23 23:50:45,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3406)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3408)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3406))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3408))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3403) .cse6 v_ArrVal_3405) .cse7 v_ArrVal_3407) .cse8 v_ArrVal_3410) (select (select (store .cse9 .cse8 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3412))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3404))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3406))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3408))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3403) .cse12 v_ArrVal_3405) .cse13 v_ArrVal_3407) .cse14 v_prenex_40) (select (select (store .cse15 .cse14 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-23 23:50:50,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3406))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3408))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3403) .cse1 v_ArrVal_3405) .cse2 v_ArrVal_3407) .cse3 v_prenex_40) (select (select (store .cse4 .cse3 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3406)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3408)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3409))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) .cse10)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3404))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3406))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3408))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3403) .cse13 v_ArrVal_3405) .cse14 v_ArrVal_3407) .cse15 v_ArrVal_3410) (select (select (store .cse16 .cse15 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3412))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))) is different from false [2024-11-23 23:50:54,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3404))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3406))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3408))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3402) .cse0 v_ArrVal_3403) .cse1 v_ArrVal_3405) .cse2 v_ArrVal_3407) .cse3 v_ArrVal_3410) (select (select (store .cse4 .cse3 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3412))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3404)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3406)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3408)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3409))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3401))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3404))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3406))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3408))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3402) .cse15 v_ArrVal_3403) .cse16 v_ArrVal_3405) .cse17 v_ArrVal_3407) .cse18 v_prenex_40) (select (select (store .cse19 .cse18 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) is different from false [2024-11-23 23:50:59,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3404))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3406))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3402) .cse1 v_ArrVal_3403) .cse2 v_ArrVal_3405) .cse3 v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3404)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3406)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3408)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3409))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse12)))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3401))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3404))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3406))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3408))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3402) .cse16 v_ArrVal_3403) .cse17 v_ArrVal_3405) .cse18 v_ArrVal_3407) .cse19 v_ArrVal_3410) (select (select (store .cse20 .cse19 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3412))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1))))) is different from false [2024-11-23 23:51:03,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3401))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3404))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3406))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3408))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3418) .cse0 v_ArrVal_3402) .cse1 v_ArrVal_3403) .cse2 v_ArrVal_3405) .cse3 v_ArrVal_3407) .cse4 v_prenex_40) (select (select (store .cse5 .cse4 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3402 (Array Int Int)) (v_ArrVal_3403 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_ArrVal_3407 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (< (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (let ((.cse11 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_3401))) (let ((.cse12 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_3404))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3406))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3408))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3418) .cse11 v_ArrVal_3402) .cse12 v_ArrVal_3403) .cse13 v_ArrVal_3405) .cse14 v_ArrVal_3407) .cse15 v_ArrVal_3410) (select (select (store .cse16 .cse15 v_ArrVal_3409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3412))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1)) (forall ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3411 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (v_ArrVal_3404 (Array Int Int)) (v_ArrVal_3417 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3408 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3417))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3401)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3404)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3406)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3408)))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse21 (select (select (let ((.cse22 (store .cse23 .cse21 v_ArrVal_3409))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3411)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))) is different from false [2024-11-23 23:51:03,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121145616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:51:03,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:51:03,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2024-11-23 23:51:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714244471] [2024-11-23 23:51:03,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:51:03,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-23 23:51:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:51:03,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-23 23:51:03,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=713, Unknown=24, NotChecked=780, Total=1640 [2024-11-23 23:51:03,763 INFO L87 Difference]: Start difference. First operand 1596 states and 2025 transitions. Second operand has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 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-23 23:52:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:24,568 INFO L93 Difference]: Finished difference Result 1620 states and 2061 transitions. [2024-11-23 23:52:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-23 23:52:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 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-23 23:52:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:24,570 INFO L225 Difference]: With dead ends: 1620 [2024-11-23 23:52:24,570 INFO L226 Difference]: Without dead ends: 1620 [2024-11-23 23:52:24,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=234, Invalid=1430, Unknown=24, NotChecked=1068, Total=2756 [2024-11-23 23:52:24,572 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1195 mSDsluCounter, 8058 mSDsCounter, 0 mSdLazyCounter, 7308 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 8802 SdHoareTripleChecker+Invalid, 7342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 7308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:24,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 8802 Invalid, 7342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 7308 Invalid, 0 Unknown, 0 Unchecked, 77.0s Time] [2024-11-23 23:52:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-23 23:52:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1548. [2024-11-23 23:52:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1176 states have (on average 1.663265306122449) internal successors, (1956), 1536 states have internal predecessors, (1956), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:52:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1974 transitions. [2024-11-23 23:52:24,592 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1974 transitions. Word has length 107 [2024-11-23 23:52:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:24,592 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1974 transitions. [2024-11-23 23:52:24,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.625) internal successors, (159), 26 states have internal predecessors, (159), 1 states have call successors, (1), 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-23 23:52:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1974 transitions. [2024-11-23 23:52:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-23 23:52:24,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:24,593 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] [2024-11-23 23:52:24,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-23 23:52:24,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03e6779f-f497-4a56-9368-41336406198a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:24,793 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:52:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2056727382, now seen corresponding path program 1 times [2024-11-23 23:52:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144936247] [2024-11-23 23:52:24,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:25,243 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-23 23:52:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144936247] [2024-11-23 23:52:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144936247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:52:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511981787] [2024-11-23 23:52:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:25,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:52:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:25,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:52:25,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:52:25,246 INFO L87 Difference]: Start difference. First operand 1548 states and 1974 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:52:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:37,852 INFO L93 Difference]: Finished difference Result 1547 states and 1972 transitions. [2024-11-23 23:52:37,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:52:37,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-23 23:52:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:37,855 INFO L225 Difference]: With dead ends: 1547 [2024-11-23 23:52:37,855 INFO L226 Difference]: Without dead ends: 1547 [2024-11-23 23:52:37,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:52:37,855 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 5 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:37,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3691 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2024-11-23 23:52:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-23 23:52:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2024-11-23 23:52:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1176 states have (on average 1.66156462585034) internal successors, (1954), 1535 states have internal predecessors, (1954), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:52:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1972 transitions. [2024-11-23 23:52:37,873 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1972 transitions. Word has length 109 [2024-11-23 23:52:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:37,873 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 1972 transitions. [2024-11-23 23:52:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:52:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1972 transitions. [2024-11-23 23:52:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-23 23:52:37,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:37,874 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] [2024-11-23 23:52:37,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-23 23:52:37,874 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:52:37,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:37,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2056727383, now seen corresponding path program 1 times [2024-11-23 23:52:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152371116] [2024-11-23 23:52:37,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:43,113 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-23 23:52:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152371116] [2024-11-23 23:52:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152371116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:52:43,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:52:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-23 23:52:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077753542] [2024-11-23 23:52:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:52:43,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:52:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:43,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:52:43,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:52:43,115 INFO L87 Difference]: Start difference. First operand 1547 states and 1972 transitions. Second operand has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:54:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:54:01,544 INFO L93 Difference]: Finished difference Result 1629 states and 2075 transitions. [2024-11-23 23:54:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:54:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-23 23:54:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:54:01,547 INFO L225 Difference]: With dead ends: 1629 [2024-11-23 23:54:01,548 INFO L226 Difference]: Without dead ends: 1629 [2024-11-23 23:54:01,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-23 23:54:01,549 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1211 mSDsluCounter, 8912 mSDsCounter, 0 mSdLazyCounter, 7476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 9657 SdHoareTripleChecker+Invalid, 7501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:54:01,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 9657 Invalid, 7501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7476 Invalid, 0 Unknown, 0 Unchecked, 75.7s Time] [2024-11-23 23:54:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-23 23:54:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1600. [2024-11-23 23:54:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1228 states have (on average 1.6343648208469055) internal successors, (2007), 1586 states have internal predecessors, (2007), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-23 23:54:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2027 transitions. [2024-11-23 23:54:01,581 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2027 transitions. Word has length 109 [2024-11-23 23:54:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:54:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2027 transitions. [2024-11-23 23:54:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:54:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2027 transitions. [2024-11-23 23:54:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 23:54:01,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:54:01,587 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-23 23:54:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-23 23:54:01,588 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:54:01,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:54:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1528558768, now seen corresponding path program 1 times [2024-11-23 23:54:01,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:54:01,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753584850] [2024-11-23 23:54:01,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:54:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:54:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:54:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 23:54:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:54:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753584850] [2024-11-23 23:54:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753584850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:54:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:54:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:54:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248031330] [2024-11-23 23:54:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:54:02,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:54:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:54:02,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:54:02,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:54:02,155 INFO L87 Difference]: Start difference. First operand 1600 states and 2027 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 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-23 23:54:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:54:14,555 INFO L93 Difference]: Finished difference Result 1599 states and 2025 transitions. [2024-11-23 23:54:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:54:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 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-23 23:54:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:54:14,557 INFO L225 Difference]: With dead ends: 1599 [2024-11-23 23:54:14,557 INFO L226 Difference]: Without dead ends: 1599 [2024-11-23 23:54:14,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:54:14,558 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 4 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:54:14,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3701 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2024-11-23 23:54:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-23 23:54:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1546. [2024-11-23 23:54:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1176 states have (on average 1.6598639455782314) internal successors, (1952), 1534 states have internal predecessors, (1952), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:54:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1970 transitions. [2024-11-23 23:54:14,571 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1970 transitions. Word has length 110 [2024-11-23 23:54:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:54:14,571 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 1970 transitions. [2024-11-23 23:54:14,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 5 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-23 23:54:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1970 transitions. [2024-11-23 23:54:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 23:54:14,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:54:14,572 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-23 23:54:14,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-23 23:54:14,572 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:54:14,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:54:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash -665959914, now seen corresponding path program 1 times [2024-11-23 23:54:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:54:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595200058] [2024-11-23 23:54:14,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:54:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:54:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:54:20,539 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-23 23:54:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:54:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595200058] [2024-11-23 23:54:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595200058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:54:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:54:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-23 23:54:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117941135] [2024-11-23 23:54:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:54:20,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-23 23:54:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:54:20,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-23 23:54:20,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-23 23:54:20,541 INFO L87 Difference]: Start difference. First operand 1546 states and 1970 transitions. Second operand has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 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-23 23:55:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:55:39,849 INFO L93 Difference]: Finished difference Result 1629 states and 2073 transitions. [2024-11-23 23:55:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-23 23:55:39,849 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 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-23 23:55:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:55:39,851 INFO L225 Difference]: With dead ends: 1629 [2024-11-23 23:55:39,851 INFO L226 Difference]: Without dead ends: 1629 [2024-11-23 23:55:39,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2024-11-23 23:55:39,852 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1212 mSDsluCounter, 10153 mSDsCounter, 0 mSdLazyCounter, 7529 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 7558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:55:39,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 10900 Invalid, 7558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7529 Invalid, 0 Unknown, 0 Unchecked, 76.0s Time] [2024-11-23 23:55:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-23 23:55:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1601. [2024-11-23 23:55:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1230 states have (on average 1.6317073170731706) internal successors, (2007), 1587 states have internal predecessors, (2007), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-23 23:55:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2031 transitions. [2024-11-23 23:55:39,868 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2031 transitions. Word has length 110 [2024-11-23 23:55:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:55:39,869 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2031 transitions. [2024-11-23 23:55:39,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.4) internal successors, (108), 21 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-23 23:55:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2031 transitions. [2024-11-23 23:55:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 23:55:39,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:55:39,870 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-23 23:55:39,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-23 23:55:39,870 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-23 23:55:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:55:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash -665959913, now seen corresponding path program 1 times [2024-11-23 23:55:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:55:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326204761] [2024-11-23 23:55:39,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:55:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:55:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:55:45,476 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-23 23:55:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:55:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326204761] [2024-11-23 23:55:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326204761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:55:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:55:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-23 23:55:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944503011] [2024-11-23 23:55:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:55:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:55:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:55:45,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:55:45,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:55:45,478 INFO L87 Difference]: Start difference. First operand 1601 states and 2031 transitions. Second operand has 19 states, 18 states have (on average 6.0) internal successors, (108), 19 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)