./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:22:24,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:22:24,235 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:22:24,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:22:24,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:22:24,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:22:24,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:22:24,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:22:24,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:22:24,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:22:24,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:22:24,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:22:24,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:22:24,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:22:24,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:22:24,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:22:24,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:22:24,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:22:24,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:22:24,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:22:24,310 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:22:24,310 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:22:24,311 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:22:24,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:22:24,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:22:24,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:22:24,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:22:24,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:22:24,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:22:24,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:22:24,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:22:24,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:22:24,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:22:24,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:22:24,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:22:24,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:22:24,315 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_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-13 14:22:24,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:22:24,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:22:24,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:22:24,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:22:24,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:22:24,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i Unable to find full path for "g++" [2024-11-13 14:22:27,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:22:27,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:22:27,676 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-11-13 14:22:27,709 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data/915530de4/c2c62dd9d60e4d77ac2c1d0b8274dcb0/FLAGff617f389 [2024-11-13 14:22:27,737 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data/915530de4/c2c62dd9d60e4d77ac2c1d0b8274dcb0 [2024-11-13 14:22:27,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:22:27,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:22:27,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:22:27,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:22:27,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:22:27,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:22:27" (1/1) ... [2024-11-13 14:22:27,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff9cd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:27, skipping insertion in model container [2024-11-13 14:22:27,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:22:27" (1/1) ... [2024-11-13 14:22:27,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:22:28,514 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,566 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,572 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,583 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,669 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,669 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,678 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,680 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:22:28,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:22:28,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:22:28,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:22:28,917 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:22:28,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28 WrapperNode [2024-11-13 14:22:28,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:22:28,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:22:28,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:22:28,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:22:28,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:28,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,076 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-13 14:22:29,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:22:29,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:22:29,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:22:29,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:22:29,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,231 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-13 14:22:29,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:22:29,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:22:29,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:22:29,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:22:29,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (1/1) ... [2024-11-13 14:22:29,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:22:29,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:22:29,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:22:29,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:22:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 14:22:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 14:22:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 14:22:29,512 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 14:22:29,512 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 14:22:29,513 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:22:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:22:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:22:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:22:29,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:22:29,857 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:22:29,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:22:29,864 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:22:29,944 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:22:29,969 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:22:33,186 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-13 14:22:33,187 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:22:33,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:22:33,262 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-13 14:22:33,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:22:33 BoogieIcfgContainer [2024-11-13 14:22:33,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:22:33,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:22:33,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:22:33,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:22:33,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:22:27" (1/3) ... [2024-11-13 14:22:33,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75df2d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:22:33, skipping insertion in model container [2024-11-13 14:22:33,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:22:28" (2/3) ... [2024-11-13 14:22:33,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75df2d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:22:33, skipping insertion in model container [2024-11-13 14:22:33,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:22:33" (3/3) ... [2024-11-13 14:22:33,287 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2024-11-13 14:22:33,308 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:22:33,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 1063 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-11-13 14:22:33,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:22:33,409 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;@6cecce9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:22:33,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-13 14:22:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:22:33,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:33,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:22:33,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:33,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1758810, now seen corresponding path program 1 times [2024-11-13 14:22:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038663874] [2024-11-13 14:22:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:33,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038663874] [2024-11-13 14:22:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038663874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:33,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:33,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:33,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323615263] [2024-11-13 14:22:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:33,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:33,840 INFO L87 Difference]: Start difference. First operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:35,402 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-13 14:22:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 14:22:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:35,424 INFO L225 Difference]: With dead ends: 1349 [2024-11-13 14:22:35,425 INFO L226 Difference]: Without dead ends: 1345 [2024-11-13 14:22:35,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:35,430 INFO L432 NwaCegarLoop]: 1098 mSDtfsCounter, 382 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:35,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 2648 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:22:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-13 14:22:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-13 14:22:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 844 states have (on average 1.8815165876777251) internal successors, (1588), 1255 states have internal predecessors, (1588), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-13 14:22:35,544 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-13 14:22:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:35,545 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-13 14:22:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-13 14:22:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:22:35,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:35,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:22:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:22:35,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-13 14:22:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657222423] [2024-11-13 14:22:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657222423] [2024-11-13 14:22:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657222423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:35,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:35,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:22:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62340430] [2024-11-13 14:22:35,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:35,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:35,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:35,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:35,661 INFO L87 Difference]: Start difference. First operand 1260 states and 1594 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:36,473 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-13 14:22:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:36,474 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-13 14:22:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:36,483 INFO L225 Difference]: With dead ends: 1257 [2024-11-13 14:22:36,483 INFO L226 Difference]: Without dead ends: 1257 [2024-11-13 14:22:36,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:36,488 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:36,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 861 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:22:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-13 14:22:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-13 14:22:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 852 states have (on average 1.8544600938967135) internal successors, (1580), 1252 states have internal predecessors, (1580), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-13 14:22:36,561 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-13 14:22:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:36,562 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-13 14:22:36,562 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-13 14:22:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-13 14:22:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:22:36,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:36,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:22:36,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:22:36,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:36,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-13 14:22:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199202555] [2024-11-13 14:22:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199202555] [2024-11-13 14:22:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199202555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:22:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971340798] [2024-11-13 14:22:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:36,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:36,709 INFO L87 Difference]: Start difference. First operand 1257 states and 1586 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:37,729 INFO L93 Difference]: Finished difference Result 1341 states and 1581 transitions. [2024-11-13 14:22:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:37,731 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-13 14:22:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:37,739 INFO L225 Difference]: With dead ends: 1341 [2024-11-13 14:22:37,740 INFO L226 Difference]: Without dead ends: 1341 [2024-11-13 14:22:37,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:37,744 INFO L432 NwaCegarLoop]: 1100 mSDtfsCounter, 380 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:37,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1874 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:22:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-13 14:22:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1256. [2024-11-13 14:22:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 852 states have (on average 1.846244131455399) internal successors, (1573), 1251 states have internal predecessors, (1573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1579 transitions. [2024-11-13 14:22:37,822 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1579 transitions. Word has length 4 [2024-11-13 14:22:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:37,823 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1579 transitions. [2024-11-13 14:22:37,823 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-13 14:22:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1579 transitions. [2024-11-13 14:22:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 14:22:37,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:37,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:37,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:22:37,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:37,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-13 14:22:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126203117] [2024-11-13 14:22:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126203117] [2024-11-13 14:22:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126203117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245523018] [2024-11-13 14:22:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:22:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:22:38,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:38,160 INFO L87 Difference]: Start difference. First operand 1256 states and 1579 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:39,938 INFO L93 Difference]: Finished difference Result 1330 states and 1569 transitions. [2024-11-13 14:22:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:22:39,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 14:22:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:39,944 INFO L225 Difference]: With dead ends: 1330 [2024-11-13 14:22:39,945 INFO L226 Difference]: Without dead ends: 1330 [2024-11-13 14:22:39,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:22:39,946 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 2174 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:39,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 1119 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 14:22:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-13 14:22:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1245. [2024-11-13 14:22:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 852 states have (on average 1.8321596244131455) internal successors, (1561), 1240 states have internal predecessors, (1561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1567 transitions. [2024-11-13 14:22:39,982 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1567 transitions. Word has length 8 [2024-11-13 14:22:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:39,982 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1567 transitions. [2024-11-13 14:22:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1567 transitions. [2024-11-13 14:22:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:22:39,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:39,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:22:39,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-13 14:22:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067284340] [2024-11-13 14:22:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067284340] [2024-11-13 14:22:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067284340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:22:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428479520] [2024-11-13 14:22:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:40,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:40,069 INFO L87 Difference]: Start difference. First operand 1245 states and 1567 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:41,041 INFO L93 Difference]: Finished difference Result 1283 states and 1522 transitions. [2024-11-13 14:22:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 14:22:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:41,047 INFO L225 Difference]: With dead ends: 1283 [2024-11-13 14:22:41,047 INFO L226 Difference]: Without dead ends: 1283 [2024-11-13 14:22:41,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:41,050 INFO L432 NwaCegarLoop]: 1111 mSDtfsCounter, 1060 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:41,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1407 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:22:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-13 14:22:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1198. [2024-11-13 14:22:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 852 states have (on average 1.7769953051643192) internal successors, (1514), 1193 states have internal predecessors, (1514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1520 transitions. [2024-11-13 14:22:41,085 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1520 transitions. Word has length 9 [2024-11-13 14:22:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:41,087 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1520 transitions. [2024-11-13 14:22:41,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1520 transitions. [2024-11-13 14:22:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:22:41,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:41,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:41,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:22:41,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:41,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-13 14:22:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:41,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607211418] [2024-11-13 14:22:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607211418] [2024-11-13 14:22:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607211418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:41,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:22:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328081248] [2024-11-13 14:22:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:41,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:41,261 INFO L87 Difference]: Start difference. First operand 1198 states and 1520 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:42,266 INFO L93 Difference]: Finished difference Result 1483 states and 1881 transitions. [2024-11-13 14:22:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 14:22:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:42,273 INFO L225 Difference]: With dead ends: 1483 [2024-11-13 14:22:42,274 INFO L226 Difference]: Without dead ends: 1483 [2024-11-13 14:22:42,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:42,276 INFO L432 NwaCegarLoop]: 1244 mSDtfsCounter, 852 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:42,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1658 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:22:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-13 14:22:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1173. [2024-11-13 14:22:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 852 states have (on average 1.7476525821596245) internal successors, (1489), 1168 states have internal predecessors, (1489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1495 transitions. [2024-11-13 14:22:42,339 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1495 transitions. Word has length 9 [2024-11-13 14:22:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:42,339 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1495 transitions. [2024-11-13 14:22:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1495 transitions. [2024-11-13 14:22:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 14:22:42,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:42,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:42,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:22:42,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:42,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2040141864, now seen corresponding path program 1 times [2024-11-13 14:22:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832458914] [2024-11-13 14:22:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:42,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832458914] [2024-11-13 14:22:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832458914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:42,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890496472] [2024-11-13 14:22:42,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:42,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:42,441 INFO L87 Difference]: Start difference. First operand 1173 states and 1495 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:43,441 INFO L93 Difference]: Finished difference Result 1248 states and 1601 transitions. [2024-11-13 14:22:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:43,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 14:22:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:43,447 INFO L225 Difference]: With dead ends: 1248 [2024-11-13 14:22:43,447 INFO L226 Difference]: Without dead ends: 1248 [2024-11-13 14:22:43,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:43,450 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 1286 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:43,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1398 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:22:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-11-13 14:22:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1150. [2024-11-13 14:22:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 852 states have (on average 1.693661971830986) internal successors, (1443), 1145 states have internal predecessors, (1443), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1449 transitions. [2024-11-13 14:22:43,482 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1449 transitions. Word has length 14 [2024-11-13 14:22:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:43,482 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1449 transitions. [2024-11-13 14:22:43,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1449 transitions. [2024-11-13 14:22:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 14:22:43,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:43,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:43,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:22:43,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:43,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2040141863, now seen corresponding path program 1 times [2024-11-13 14:22:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:43,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601064501] [2024-11-13 14:22:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:43,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601064501] [2024-11-13 14:22:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601064501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700331403] [2024-11-13 14:22:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:43,713 INFO L87 Difference]: Start difference. First operand 1150 states and 1449 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:44,894 INFO L93 Difference]: Finished difference Result 1182 states and 1413 transitions. [2024-11-13 14:22:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 14:22:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:44,900 INFO L225 Difference]: With dead ends: 1182 [2024-11-13 14:22:44,900 INFO L226 Difference]: Without dead ends: 1182 [2024-11-13 14:22:44,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:44,901 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 431 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:44,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 2433 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:22:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-13 14:22:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1086. [2024-11-13 14:22:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 788 states have (on average 1.6865482233502538) internal successors, (1329), 1081 states have internal predecessors, (1329), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1335 transitions. [2024-11-13 14:22:44,931 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1335 transitions. Word has length 14 [2024-11-13 14:22:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:44,932 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1335 transitions. [2024-11-13 14:22:44,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1335 transitions. [2024-11-13 14:22:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 14:22:44,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:44,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:22:44,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2071047692, now seen corresponding path program 1 times [2024-11-13 14:22:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377183588] [2024-11-13 14:22:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377183588] [2024-11-13 14:22:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377183588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100251968] [2024-11-13 14:22:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:45,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:45,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:45,009 INFO L87 Difference]: Start difference. First operand 1086 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:45,095 INFO L93 Difference]: Finished difference Result 1064 states and 1299 transitions. [2024-11-13 14:22:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:45,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 14:22:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:45,099 INFO L225 Difference]: With dead ends: 1064 [2024-11-13 14:22:45,100 INFO L226 Difference]: Without dead ends: 1064 [2024-11-13 14:22:45,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:45,101 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 143 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:45,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 2982 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:22:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-13 14:22:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1058. [2024-11-13 14:22:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 767 states have (on average 1.6779661016949152) internal successors, (1287), 1053 states have internal predecessors, (1287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1293 transitions. [2024-11-13 14:22:45,127 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1293 transitions. Word has length 16 [2024-11-13 14:22:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:45,128 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1293 transitions. [2024-11-13 14:22:45,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1293 transitions. [2024-11-13 14:22:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:22:45,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:45,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:45,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:22:45,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:45,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:45,129 INFO L85 PathProgramCache]: Analyzing trace with hash -179577158, now seen corresponding path program 1 times [2024-11-13 14:22:45,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:45,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837506243] [2024-11-13 14:22:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837506243] [2024-11-13 14:22:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837506243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351821472] [2024-11-13 14:22:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:45,261 INFO L87 Difference]: Start difference. First operand 1058 states and 1293 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:46,287 INFO L93 Difference]: Finished difference Result 1124 states and 1348 transitions. [2024-11-13 14:22:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-13 14:22:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:46,292 INFO L225 Difference]: With dead ends: 1124 [2024-11-13 14:22:46,292 INFO L226 Difference]: Without dead ends: 1124 [2024-11-13 14:22:46,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:46,293 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 1274 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:46,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1826 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:22:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-13 14:22:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1035. [2024-11-13 14:22:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 767 states have (on average 1.6479791395045633) internal successors, (1264), 1030 states have internal predecessors, (1264), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1270 transitions. [2024-11-13 14:22:46,321 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1270 transitions. Word has length 19 [2024-11-13 14:22:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:46,322 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1270 transitions. [2024-11-13 14:22:46,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1270 transitions. [2024-11-13 14:22:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:22:46,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:46,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:46,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:22:46,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:46,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -179577157, now seen corresponding path program 1 times [2024-11-13 14:22:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504230232] [2024-11-13 14:22:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:46,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504230232] [2024-11-13 14:22:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504230232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:46,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:46,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:46,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172389255] [2024-11-13 14:22:46,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:46,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:46,456 INFO L87 Difference]: Start difference. First operand 1035 states and 1270 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:46,493 INFO L93 Difference]: Finished difference Result 960 states and 1167 transitions. [2024-11-13 14:22:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-13 14:22:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:46,498 INFO L225 Difference]: With dead ends: 960 [2024-11-13 14:22:46,499 INFO L226 Difference]: Without dead ends: 960 [2024-11-13 14:22:46,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:46,500 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 61 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:46,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1787 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:22:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-13 14:22:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-11-13 14:22:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 704 states have (on average 1.6491477272727273) internal successors, (1161), 955 states have internal predecessors, (1161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1167 transitions. [2024-11-13 14:22:46,522 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1167 transitions. Word has length 19 [2024-11-13 14:22:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:46,523 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1167 transitions. [2024-11-13 14:22:46,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1167 transitions. [2024-11-13 14:22:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:22:46,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:46,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:46,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:22:46,528 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr339REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:46,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1695091963, now seen corresponding path program 1 times [2024-11-13 14:22:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717789480] [2024-11-13 14:22:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717789480] [2024-11-13 14:22:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717789480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072552898] [2024-11-13 14:22:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:46,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:46,624 INFO L87 Difference]: Start difference. First operand 960 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:46,660 INFO L93 Difference]: Finished difference Result 879 states and 1057 transitions. [2024-11-13 14:22:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-13 14:22:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:46,665 INFO L225 Difference]: With dead ends: 879 [2024-11-13 14:22:46,665 INFO L226 Difference]: Without dead ends: 879 [2024-11-13 14:22:46,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:46,666 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 33 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:46,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1609 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:22:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-13 14:22:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2024-11-13 14:22:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 635 states have (on average 1.6551181102362205) internal successors, (1051), 874 states have internal predecessors, (1051), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1057 transitions. [2024-11-13 14:22:46,685 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1057 transitions. Word has length 19 [2024-11-13 14:22:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:46,686 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1057 transitions. [2024-11-13 14:22:46,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1057 transitions. [2024-11-13 14:22:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 14:22:46,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:46,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:46,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:22:46,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash -774800042, now seen corresponding path program 1 times [2024-11-13 14:22:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925422393] [2024-11-13 14:22:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:46,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925422393] [2024-11-13 14:22:46,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925422393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116028396] [2024-11-13 14:22:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:46,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:46,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:46,783 INFO L87 Difference]: Start difference. First operand 879 states and 1057 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:46,857 INFO L93 Difference]: Finished difference Result 861 states and 1032 transitions. [2024-11-13 14:22:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 14:22:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:46,861 INFO L225 Difference]: With dead ends: 861 [2024-11-13 14:22:46,861 INFO L226 Difference]: Without dead ends: 861 [2024-11-13 14:22:46,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:46,862 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 41 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2318 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-13 14:22:46,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2318 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:22:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-13 14:22:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 858. [2024-11-13 14:22:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 621 states have (on average 1.6473429951690821) internal successors, (1023), 853 states have internal predecessors, (1023), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1029 transitions. [2024-11-13 14:22:46,881 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1029 transitions. Word has length 21 [2024-11-13 14:22:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:46,882 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1029 transitions. [2024-11-13 14:22:46,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1029 transitions. [2024-11-13 14:22:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:22:46,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:46,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:46,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:22:46,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:46,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -523088604, now seen corresponding path program 1 times [2024-11-13 14:22:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:46,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850882786] [2024-11-13 14:22:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850882786] [2024-11-13 14:22:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850882786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:47,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343067316] [2024-11-13 14:22:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:47,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:47,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:47,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:47,075 INFO L87 Difference]: Start difference. First operand 858 states and 1029 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:48,127 INFO L93 Difference]: Finished difference Result 1180 states and 1424 transitions. [2024-11-13 14:22:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:22:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-13 14:22:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:48,133 INFO L225 Difference]: With dead ends: 1180 [2024-11-13 14:22:48,133 INFO L226 Difference]: Without dead ends: 1180 [2024-11-13 14:22:48,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:48,134 INFO L432 NwaCegarLoop]: 885 mSDtfsCounter, 647 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:48,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1893 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:22:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-13 14:22:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 854. [2024-11-13 14:22:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 621 states have (on average 1.640901771336554) internal successors, (1019), 849 states have internal predecessors, (1019), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1025 transitions. [2024-11-13 14:22:48,154 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1025 transitions. Word has length 35 [2024-11-13 14:22:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1025 transitions. [2024-11-13 14:22:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1025 transitions. [2024-11-13 14:22:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 14:22:48,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:48,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:22:48,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1953401108, now seen corresponding path program 1 times [2024-11-13 14:22:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606386927] [2024-11-13 14:22:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606386927] [2024-11-13 14:22:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606386927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725856274] [2024-11-13 14:22:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:48,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:48,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:48,315 INFO L87 Difference]: Start difference. First operand 854 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:48,389 INFO L93 Difference]: Finished difference Result 854 states and 1017 transitions. [2024-11-13 14:22:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:22:48,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-13 14:22:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:48,393 INFO L225 Difference]: With dead ends: 854 [2024-11-13 14:22:48,393 INFO L226 Difference]: Without dead ends: 854 [2024-11-13 14:22:48,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:48,394 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 27 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:48,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2294 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:22:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-13 14:22:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2024-11-13 14:22:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 621 states have (on average 1.6280193236714975) internal successors, (1011), 849 states have internal predecessors, (1011), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1017 transitions. [2024-11-13 14:22:48,412 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1017 transitions. Word has length 62 [2024-11-13 14:22:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:48,412 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1017 transitions. [2024-11-13 14:22:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1017 transitions. [2024-11-13 14:22:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 14:22:48,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:48,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:48,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:22:48,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:48,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1535646678, now seen corresponding path program 1 times [2024-11-13 14:22:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759940370] [2024-11-13 14:22:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759940370] [2024-11-13 14:22:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759940370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950416303] [2024-11-13 14:22:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:22:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:22:48,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:22:48,592 INFO L87 Difference]: Start difference. First operand 854 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:48,658 INFO L93 Difference]: Finished difference Result 854 states and 1013 transitions. [2024-11-13 14:22:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:22:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-13 14:22:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:48,662 INFO L225 Difference]: With dead ends: 854 [2024-11-13 14:22:48,663 INFO L226 Difference]: Without dead ends: 854 [2024-11-13 14:22:48,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:48,666 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 21 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:48,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2288 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:22:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-13 14:22:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2024-11-13 14:22:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 621 states have (on average 1.6215780998389695) internal successors, (1007), 849 states have internal predecessors, (1007), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1013 transitions. [2024-11-13 14:22:48,684 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1013 transitions. Word has length 69 [2024-11-13 14:22:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:48,685 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1013 transitions. [2024-11-13 14:22:48,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1013 transitions. [2024-11-13 14:22:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 14:22:48,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:48,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:22:48,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:48,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1787180320, now seen corresponding path program 1 times [2024-11-13 14:22:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573706996] [2024-11-13 14:22:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573706996] [2024-11-13 14:22:48,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573706996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:48,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:48,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:22:48,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274638255] [2024-11-13 14:22:48,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:48,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:22:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:48,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:22:48,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:48,920 INFO L87 Difference]: Start difference. First operand 854 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:49,009 INFO L93 Difference]: Finished difference Result 1018 states and 1186 transitions. [2024-11-13 14:22:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:22:49,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-13 14:22:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:49,014 INFO L225 Difference]: With dead ends: 1018 [2024-11-13 14:22:49,014 INFO L226 Difference]: Without dead ends: 1018 [2024-11-13 14:22:49,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:22:49,015 INFO L432 NwaCegarLoop]: 794 mSDtfsCounter, 198 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:49,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1536 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:22:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-13 14:22:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1008. [2024-11-13 14:22:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 775 states have (on average 1.5174193548387096) internal successors, (1176), 1003 states have internal predecessors, (1176), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1182 transitions. [2024-11-13 14:22:49,038 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1182 transitions. Word has length 70 [2024-11-13 14:22:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:49,039 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1182 transitions. [2024-11-13 14:22:49,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1182 transitions. [2024-11-13 14:22:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 14:22:49,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:49,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:49,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:22:49,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:49,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1807782790, now seen corresponding path program 1 times [2024-11-13 14:22:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301910270] [2024-11-13 14:22:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301910270] [2024-11-13 14:22:49,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301910270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:49,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:22:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406785495] [2024-11-13 14:22:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:49,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:22:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:22:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:22:49,731 INFO L87 Difference]: Start difference. First operand 1008 states and 1182 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:50,029 INFO L93 Difference]: Finished difference Result 1480 states and 1684 transitions. [2024-11-13 14:22:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:22:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-13 14:22:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:50,037 INFO L225 Difference]: With dead ends: 1480 [2024-11-13 14:22:50,037 INFO L226 Difference]: Without dead ends: 1477 [2024-11-13 14:22:50,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:22:50,039 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 727 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 4586 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:50,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 4586 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:22:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2024-11-13 14:22:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 909. [2024-11-13 14:22:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 676 states have (on average 1.5502958579881656) internal successors, (1048), 904 states have internal predecessors, (1048), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1054 transitions. [2024-11-13 14:22:50,072 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1054 transitions. Word has length 76 [2024-11-13 14:22:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:50,072 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1054 transitions. [2024-11-13 14:22:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1054 transitions. [2024-11-13 14:22:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 14:22:50,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:50,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:22:50,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1111266443, now seen corresponding path program 1 times [2024-11-13 14:22:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384448797] [2024-11-13 14:22:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384448797] [2024-11-13 14:22:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384448797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:50,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624997377] [2024-11-13 14:22:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:50,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:22:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:22:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:50,522 INFO L87 Difference]: Start difference. First operand 909 states and 1054 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:51,537 INFO L93 Difference]: Finished difference Result 908 states and 1053 transitions. [2024-11-13 14:22:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:22:51,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-13 14:22:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:51,541 INFO L225 Difference]: With dead ends: 908 [2024-11-13 14:22:51,541 INFO L226 Difference]: Without dead ends: 908 [2024-11-13 14:22:51,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:22:51,541 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 2 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:51,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2283 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:22:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-13 14:22:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2024-11-13 14:22:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 676 states have (on average 1.5488165680473374) internal successors, (1047), 903 states have internal predecessors, (1047), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1053 transitions. [2024-11-13 14:22:51,561 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1053 transitions. Word has length 85 [2024-11-13 14:22:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1053 transitions. [2024-11-13 14:22:51,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1053 transitions. [2024-11-13 14:22:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 14:22:51,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:51,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:51,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:22:51,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:51,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1111266442, now seen corresponding path program 1 times [2024-11-13 14:22:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318256989] [2024-11-13 14:22:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:52,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-13 14:22:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318256989] [2024-11-13 14:22:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318256989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:22:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524157765] [2024-11-13 14:22:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:22:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:22:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:22:52,231 INFO L87 Difference]: Start difference. First operand 908 states and 1053 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:53,295 INFO L93 Difference]: Finished difference Result 907 states and 1052 transitions. [2024-11-13 14:22:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:22:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-13 14:22:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:53,300 INFO L225 Difference]: With dead ends: 907 [2024-11-13 14:22:53,300 INFO L226 Difference]: Without dead ends: 907 [2024-11-13 14:22:53,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:22:53,304 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:53,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2242 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:22:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-13 14:22:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2024-11-13 14:22:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 675 states have (on average 1.5496296296296297) internal successors, (1046), 902 states have internal predecessors, (1046), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:22:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1052 transitions. [2024-11-13 14:22:53,326 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1052 transitions. Word has length 85 [2024-11-13 14:22:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:53,326 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1052 transitions. [2024-11-13 14:22:53,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1052 transitions. [2024-11-13 14:22:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 14:22:53,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:53,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:22:53,328 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:53,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1673809668, now seen corresponding path program 1 times [2024-11-13 14:22:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479447485] [2024-11-13 14:22:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:22:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479447485] [2024-11-13 14:22:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479447485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:22:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144443861] [2024-11-13 14:22:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:53,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:22:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:22:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:22:53,733 INFO L87 Difference]: Start difference. First operand 907 states and 1052 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:22:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:55,156 INFO L93 Difference]: Finished difference Result 919 states and 1067 transitions. [2024-11-13 14:22:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:22:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-13 14:22:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:55,163 INFO L225 Difference]: With dead ends: 919 [2024-11-13 14:22:55,167 INFO L226 Difference]: Without dead ends: 919 [2024-11-13 14:22:55,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:22:55,168 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 10 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:55,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3532 Invalid, 1186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:22:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-13 14:22:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 913. [2024-11-13 14:22:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 680 states have (on average 1.548529411764706) internal successors, (1053), 907 states have internal predecessors, (1053), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 14:22:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1062 transitions. [2024-11-13 14:22:55,202 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1062 transitions. Word has length 93 [2024-11-13 14:22:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:55,202 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1062 transitions. [2024-11-13 14:22:55,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:22:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1062 transitions. [2024-11-13 14:22:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 14:22:55,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:55,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:55,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 14:22:55,205 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:55,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1673809667, now seen corresponding path program 1 times [2024-11-13 14:22:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241954949] [2024-11-13 14:22:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:22:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241954949] [2024-11-13 14:22:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241954949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:22:56,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:22:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:22:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952070329] [2024-11-13 14:22:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:22:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:22:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:22:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:22:56,112 INFO L87 Difference]: Start difference. First operand 913 states and 1062 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:22:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:57,513 INFO L93 Difference]: Finished difference Result 913 states and 1061 transitions. [2024-11-13 14:22:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:22:57,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-13 14:22:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:57,525 INFO L225 Difference]: With dead ends: 913 [2024-11-13 14:22:57,529 INFO L226 Difference]: Without dead ends: 913 [2024-11-13 14:22:57,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:22:57,531 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 5 mSDsluCounter, 2753 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:57,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3533 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:22:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-11-13 14:22:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2024-11-13 14:22:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 680 states have (on average 1.5470588235294118) internal successors, (1052), 907 states have internal predecessors, (1052), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 14:22:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1061 transitions. [2024-11-13 14:22:57,580 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1061 transitions. Word has length 93 [2024-11-13 14:22:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:57,581 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1061 transitions. [2024-11-13 14:22:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:22:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1061 transitions. [2024-11-13 14:22:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:22:57,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:57,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:57,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 14:22:57,586 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:22:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash 276104355, now seen corresponding path program 1 times [2024-11-13 14:22:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:22:57,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102137441] [2024-11-13 14:22:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:22:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:22:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:58,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:22:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102137441] [2024-11-13 14:22:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102137441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:22:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357212313] [2024-11-13 14:22:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:22:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:22:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:22:58,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:22:58,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:22:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:22:58,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:22:58,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:22:58,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:22:59,084 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:22:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:22:59,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:22:59,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:22:59,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:22:59,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:22:59,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:22:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:59,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:22:59,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357212313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:22:59,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:22:59,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-13 14:22:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135975887] [2024-11-13 14:22:59,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:22:59,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:22:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:22:59,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:22:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=321, Unknown=5, NotChecked=0, Total=380 [2024-11-13 14:22:59,932 INFO L87 Difference]: Start difference. First operand 913 states and 1061 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:03,793 INFO L93 Difference]: Finished difference Result 920 states and 1068 transitions. [2024-11-13 14:23:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:23:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-13 14:23:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:03,798 INFO L225 Difference]: With dead ends: 920 [2024-11-13 14:23:03,798 INFO L226 Difference]: Without dead ends: 920 [2024-11-13 14:23:03,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=508, Unknown=5, NotChecked=0, Total=600 [2024-11-13 14:23:03,799 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 696 mSDsluCounter, 5693 mSDsCounter, 0 mSdLazyCounter, 4014 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 4028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:03,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 6182 Invalid, 4028 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 4014 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-13 14:23:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-13 14:23:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 917. [2024-11-13 14:23:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 684 states have (on average 1.543859649122807) internal successors, (1056), 910 states have internal predecessors, (1056), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1063 transitions. [2024-11-13 14:23:03,826 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1063 transitions. Word has length 94 [2024-11-13 14:23:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:03,826 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1063 transitions. [2024-11-13 14:23:03,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1063 transitions. [2024-11-13 14:23:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 14:23:03,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:03,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:03,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:23:04,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 14:23:04,036 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash 276104356, now seen corresponding path program 1 times [2024-11-13 14:23:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399200850] [2024-11-13 14:23:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399200850] [2024-11-13 14:23:05,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399200850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288446568] [2024-11-13 14:23:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:05,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:05,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:05,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:05,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:23:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:05,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 14:23:05,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:05,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:05,855 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:23:05,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:23:05,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:23:05,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:05,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:23:06,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:23:06,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:23:06,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:06,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:23:06,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:23:06,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:23:06,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:23:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:06,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288446568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:06,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-13 14:23:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213776983] [2024-11-13 14:23:06,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:06,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:23:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:23:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=385, Unknown=12, NotChecked=0, Total=462 [2024-11-13 14:23:06,648 INFO L87 Difference]: Start difference. First operand 917 states and 1063 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:10,595 INFO L93 Difference]: Finished difference Result 919 states and 1067 transitions. [2024-11-13 14:23:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:23:10,595 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-13 14:23:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:10,599 INFO L225 Difference]: With dead ends: 919 [2024-11-13 14:23:10,599 INFO L226 Difference]: Without dead ends: 919 [2024-11-13 14:23:10,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=584, Unknown=12, NotChecked=0, Total=702 [2024-11-13 14:23:10,600 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 701 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 4484 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 4940 SdHoareTripleChecker+Invalid, 4503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:10,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 4940 Invalid, 4503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4484 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-13 14:23:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-13 14:23:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 910. [2024-11-13 14:23:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 679 states have (on average 1.544918998527246) internal successors, (1049), 904 states have internal predecessors, (1049), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:23:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1055 transitions. [2024-11-13 14:23:10,620 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1055 transitions. Word has length 94 [2024-11-13 14:23:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1055 transitions. [2024-11-13 14:23:10,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1055 transitions. [2024-11-13 14:23:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:23:10,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:10,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:10,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:23:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 14:23:10,824 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 107118756, now seen corresponding path program 1 times [2024-11-13 14:23:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194842648] [2024-11-13 14:23:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194842648] [2024-11-13 14:23:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194842648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:11,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:11,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:23:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51129677] [2024-11-13 14:23:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:23:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:11,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:23:11,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:23:11,895 INFO L87 Difference]: Start difference. First operand 910 states and 1055 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:14,024 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2024-11-13 14:23:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:23:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-13 14:23:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:14,028 INFO L225 Difference]: With dead ends: 923 [2024-11-13 14:23:14,028 INFO L226 Difference]: Without dead ends: 923 [2024-11-13 14:23:14,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:23:14,029 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 710 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:14,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 3513 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 14:23:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-13 14:23:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 919. [2024-11-13 14:23:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 687 states have (on average 1.5414847161572052) internal successors, (1059), 912 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1066 transitions. [2024-11-13 14:23:14,047 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1066 transitions. Word has length 96 [2024-11-13 14:23:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:14,048 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1066 transitions. [2024-11-13 14:23:14,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1066 transitions. [2024-11-13 14:23:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 14:23:14,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:14,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:14,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 14:23:14,050 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:14,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 107118755, now seen corresponding path program 1 times [2024-11-13 14:23:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058633909] [2024-11-13 14:23:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058633909] [2024-11-13 14:23:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058633909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:14,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:14,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:23:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566160011] [2024-11-13 14:23:14,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:14,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:23:14,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:23:14,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:23:14,806 INFO L87 Difference]: Start difference. First operand 919 states and 1066 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:17,536 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2024-11-13 14:23:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:23:17,537 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-13 14:23:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:17,540 INFO L225 Difference]: With dead ends: 922 [2024-11-13 14:23:17,540 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 14:23:17,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:23:17,541 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 706 mSDsluCounter, 5228 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:17,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 5718 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 14:23:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 14:23:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-13 14:23:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 687 states have (on average 1.5400291120815137) internal successors, (1058), 912 states have internal predecessors, (1058), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1065 transitions. [2024-11-13 14:23:17,558 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1065 transitions. Word has length 96 [2024-11-13 14:23:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:17,558 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1065 transitions. [2024-11-13 14:23:17,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1065 transitions. [2024-11-13 14:23:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 14:23:17,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:17,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:17,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 14:23:17,561 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:17,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:17,561 INFO L85 PathProgramCache]: Analyzing trace with hash 563099549, now seen corresponding path program 1 times [2024-11-13 14:23:17,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524643364] [2024-11-13 14:23:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:17,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524643364] [2024-11-13 14:23:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524643364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076900121] [2024-11-13 14:23:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:18,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:18,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:23:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:19,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 14:23:19,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:19,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:19,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:23:19,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:23:19,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:23:19,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:23:19,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:19,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:23:19,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:23:19,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:19,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:23:19,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:23:19,780 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:19,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:23:19,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:23:19,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:23:19,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:23:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:19,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:20,028 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_1089 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1089 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 14:23:20,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1095 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1095) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1096 (Array Int Int)) (v_ArrVal_1095 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1096))) (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~mem54#1.base| v_ArrVal_1095) .cse1 v_ArrVal_1089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-13 14:23:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076900121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:20,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-13 14:23:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442092861] [2024-11-13 14:23:20,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:20,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:23:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:23:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=347, Unknown=10, NotChecked=78, Total=506 [2024-11-13 14:23:20,129 INFO L87 Difference]: Start difference. First operand 919 states and 1065 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:24,254 INFO L93 Difference]: Finished difference Result 921 states and 1069 transitions. [2024-11-13 14:23:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:23:24,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-13 14:23:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:24,258 INFO L225 Difference]: With dead ends: 921 [2024-11-13 14:23:24,258 INFO L226 Difference]: Without dead ends: 921 [2024-11-13 14:23:24,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=583, Unknown=11, NotChecked=102, Total=812 [2024-11-13 14:23:24,259 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 696 mSDsluCounter, 4512 mSDsCounter, 0 mSdLazyCounter, 4342 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 4357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:24,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 5003 Invalid, 4357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4342 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 14:23:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-13 14:23:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 918. [2024-11-13 14:23:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 687 states have (on average 1.5385735080058225) internal successors, (1057), 911 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1064 transitions. [2024-11-13 14:23:24,274 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1064 transitions. Word has length 97 [2024-11-13 14:23:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:24,274 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1064 transitions. [2024-11-13 14:23:24,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1064 transitions. [2024-11-13 14:23:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 14:23:24,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:24,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:24,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:23:24,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 14:23:24,476 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 563099548, now seen corresponding path program 1 times [2024-11-13 14:23:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778031351] [2024-11-13 14:23:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778031351] [2024-11-13 14:23:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778031351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197563542] [2024-11-13 14:23:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:25,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:25,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:25,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:23:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:25,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 14:23:25,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:25,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:25,820 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:23:25,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:23:25,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:26,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:23:26,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:26,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:26,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:26,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:26,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:23:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:26,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:26,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1251 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1251) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 14:23:26,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1254))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1251)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:23:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197563542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:26,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-13 14:23:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888309748] [2024-11-13 14:23:26,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:23:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:26,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:23:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=429, Unknown=7, NotChecked=86, Total=600 [2024-11-13 14:23:26,560 INFO L87 Difference]: Start difference. First operand 918 states and 1064 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:29,685 INFO L93 Difference]: Finished difference Result 920 states and 1068 transitions. [2024-11-13 14:23:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:23:29,686 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-13 14:23:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:29,689 INFO L225 Difference]: With dead ends: 920 [2024-11-13 14:23:29,689 INFO L226 Difference]: Without dead ends: 920 [2024-11-13 14:23:29,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=597, Unknown=7, NotChecked=102, Total=812 [2024-11-13 14:23:29,691 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 687 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 3982 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:29,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 6192 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3982 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 14:23:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-13 14:23:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 908. [2024-11-13 14:23:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 679 states have (on average 1.5419734904270987) internal successors, (1047), 902 states have internal predecessors, (1047), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:23:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1053 transitions. [2024-11-13 14:23:29,706 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1053 transitions. Word has length 97 [2024-11-13 14:23:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:29,707 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1053 transitions. [2024-11-13 14:23:29,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1053 transitions. [2024-11-13 14:23:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:23:29,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:29,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:29,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:23:29,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 14:23:29,909 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash 14767811, now seen corresponding path program 1 times [2024-11-13 14:23:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36534635] [2024-11-13 14:23:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36534635] [2024-11-13 14:23:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36534635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:23:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547470947] [2024-11-13 14:23:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:23:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:23:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:23:30,730 INFO L87 Difference]: Start difference. First operand 908 states and 1053 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:33,064 INFO L93 Difference]: Finished difference Result 924 states and 1072 transitions. [2024-11-13 14:23:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:23:33,064 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-13 14:23:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:33,067 INFO L225 Difference]: With dead ends: 924 [2024-11-13 14:23:33,067 INFO L226 Difference]: Without dead ends: 924 [2024-11-13 14:23:33,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:23:33,069 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 715 mSDsluCounter, 3816 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:33,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 4304 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 14:23:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-13 14:23:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2024-11-13 14:23:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 690 states have (on average 1.536231884057971) internal successors, (1060), 913 states have internal predecessors, (1060), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1067 transitions. [2024-11-13 14:23:33,085 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1067 transitions. Word has length 99 [2024-11-13 14:23:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:33,086 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1067 transitions. [2024-11-13 14:23:33,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1067 transitions. [2024-11-13 14:23:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:23:33,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:33,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:33,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 14:23:33,088 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:33,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 14767812, now seen corresponding path program 1 times [2024-11-13 14:23:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553304083] [2024-11-13 14:23:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:33,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553304083] [2024-11-13 14:23:34,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553304083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:34,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:34,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:23:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687068519] [2024-11-13 14:23:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:34,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:23:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:23:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:23:34,177 INFO L87 Difference]: Start difference. First operand 920 states and 1067 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:36,600 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2024-11-13 14:23:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:23:36,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-13 14:23:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:36,604 INFO L225 Difference]: With dead ends: 923 [2024-11-13 14:23:36,604 INFO L226 Difference]: Without dead ends: 923 [2024-11-13 14:23:36,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:23:36,605 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 707 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3405 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:36,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3405 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2865 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:23:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-13 14:23:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-13 14:23:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 690 states have (on average 1.5347826086956522) internal successors, (1059), 913 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1066 transitions. [2024-11-13 14:23:36,619 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1066 transitions. Word has length 99 [2024-11-13 14:23:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:36,620 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1066 transitions. [2024-11-13 14:23:36,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1066 transitions. [2024-11-13 14:23:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:23:36,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:36,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:36,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 14:23:36,622 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:36,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash -842985174, now seen corresponding path program 1 times [2024-11-13 14:23:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944020978] [2024-11-13 14:23:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:37,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944020978] [2024-11-13 14:23:37,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944020978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551283021] [2024-11-13 14:23:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:37,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:37,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:23:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:37,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:23:37,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:37,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:37,993 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:23:37,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:23:38,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:38,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:23:38,439 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:38,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:38,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:38,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:38,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:38,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:38,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:23:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:38,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:38,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1566) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-13 14:23:38,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (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_1566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-13 14:23:38,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:23:38,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1569))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1565)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:23:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551283021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:38,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:38,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-13 14:23:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624747439] [2024-11-13 14:23:38,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:38,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 14:23:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:38,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 14:23:38,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=509, Unknown=10, NotChecked=196, Total=812 [2024-11-13 14:23:38,902 INFO L87 Difference]: Start difference. First operand 920 states and 1066 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:42,130 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2024-11-13 14:23:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:23:42,131 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-13 14:23:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:42,133 INFO L225 Difference]: With dead ends: 922 [2024-11-13 14:23:42,133 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 14:23:42,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=693, Unknown=10, NotChecked=228, Total=1056 [2024-11-13 14:23:42,134 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 684 mSDsluCounter, 5673 mSDsCounter, 0 mSdLazyCounter, 3998 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 6160 SdHoareTripleChecker+Invalid, 4013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:42,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 6160 Invalid, 4013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3998 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 14:23:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 14:23:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2024-11-13 14:23:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 690 states have (on average 1.5333333333333334) internal successors, (1058), 912 states have internal predecessors, (1058), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1065 transitions. [2024-11-13 14:23:42,149 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1065 transitions. Word has length 100 [2024-11-13 14:23:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:42,149 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1065 transitions. [2024-11-13 14:23:42,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1065 transitions. [2024-11-13 14:23:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:23:42,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:42,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:42,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 14:23:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:42,351 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -842985173, now seen corresponding path program 1 times [2024-11-13 14:23:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866527476] [2024-11-13 14:23:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:43,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866527476] [2024-11-13 14:23:43,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866527476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390599462] [2024-11-13 14:23:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:43,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:43,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:23:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:43,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 14:23:43,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:43,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:44,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:23:44,043 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:23:44,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:23:44,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:44,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:44,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:23:44,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:23:44,345 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:23:44,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:23:44,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:44,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:23:44,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:23:44,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:44,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:23:44,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-13 14:23:44,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:23:44,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-13 14:23:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:44,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:44,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1739 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1739))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1740))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse0 .cse2 v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1739 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1739))) (or (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-13 14:23:44,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1739 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1739))) (or (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))) (forall ((v_ArrVal_1739 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1739))) (or (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1740))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse3 .cse4 v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0))))))) is different from false [2024-11-13 14:23:45,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1747))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1748) .cse5 v_ArrVal_1739))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1740))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1747))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1748) .cse8 v_ArrVal_1739))) (or (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))))) is different from false [2024-11-13 14:23:45,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390599462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:45,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:23:45,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-13 14:23:45,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857315753] [2024-11-13 14:23:45,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:23:45,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 14:23:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 14:23:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=661, Unknown=3, NotChecked=162, Total=930 [2024-11-13 14:23:45,132 INFO L87 Difference]: Start difference. First operand 919 states and 1065 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:50,480 INFO L93 Difference]: Finished difference Result 921 states and 1069 transitions. [2024-11-13 14:23:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:23:50,481 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-13 14:23:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:50,483 INFO L225 Difference]: With dead ends: 921 [2024-11-13 14:23:50,483 INFO L226 Difference]: Without dead ends: 921 [2024-11-13 14:23:50,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=1024, Unknown=3, NotChecked=204, Total=1406 [2024-11-13 14:23:50,484 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 692 mSDsluCounter, 6422 mSDsCounter, 0 mSdLazyCounter, 6345 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 6912 SdHoareTripleChecker+Invalid, 6362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:50,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 6912 Invalid, 6362 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 6345 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-13 14:23:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-13 14:23:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 906. [2024-11-13 14:23:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 679 states have (on average 1.5390279823269515) internal successors, (1045), 900 states have internal predecessors, (1045), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:23:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1051 transitions. [2024-11-13 14:23:50,500 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1051 transitions. Word has length 100 [2024-11-13 14:23:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:50,501 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1051 transitions. [2024-11-13 14:23:50,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:23:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1051 transitions. [2024-11-13 14:23:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 14:23:50,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:50,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:50,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:23:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:50,704 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:50,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1861838794, now seen corresponding path program 1 times [2024-11-13 14:23:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433992393] [2024-11-13 14:23:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433992393] [2024-11-13 14:23:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433992393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:23:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603815650] [2024-11-13 14:23:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:23:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:23:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:23:51,404 INFO L87 Difference]: Start difference. First operand 906 states and 1051 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:53,925 INFO L93 Difference]: Finished difference Result 925 states and 1073 transitions. [2024-11-13 14:23:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:23:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 14:23:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:53,927 INFO L225 Difference]: With dead ends: 925 [2024-11-13 14:23:53,928 INFO L226 Difference]: Without dead ends: 925 [2024-11-13 14:23:53,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:23:53,928 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 715 mSDsluCounter, 4747 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 5237 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:53,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 5237 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:23:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-13 14:23:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2024-11-13 14:23:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 693 states have (on average 1.531024531024531) internal successors, (1061), 914 states have internal predecessors, (1061), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1068 transitions. [2024-11-13 14:23:53,943 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1068 transitions. Word has length 102 [2024-11-13 14:23:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:53,943 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1068 transitions. [2024-11-13 14:23:53,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1068 transitions. [2024-11-13 14:23:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 14:23:53,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:53,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:53,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 14:23:53,946 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1861838795, now seen corresponding path program 1 times [2024-11-13 14:23:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709407879] [2024-11-13 14:23:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709407879] [2024-11-13 14:23:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709407879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:55,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:55,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:23:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344438414] [2024-11-13 14:23:55,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:55,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:23:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:23:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:23:55,078 INFO L87 Difference]: Start difference. First operand 921 states and 1068 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:23:57,428 INFO L93 Difference]: Finished difference Result 924 states and 1072 transitions. [2024-11-13 14:23:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:23:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-13 14:23:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:23:57,431 INFO L225 Difference]: With dead ends: 924 [2024-11-13 14:23:57,431 INFO L226 Difference]: Without dead ends: 924 [2024-11-13 14:23:57,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:23:57,432 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 709 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:23:57,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 3438 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2852 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 14:23:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-13 14:23:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-13 14:23:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 693 states have (on average 1.5295815295815296) internal successors, (1060), 914 states have internal predecessors, (1060), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:23:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1067 transitions. [2024-11-13 14:23:57,456 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1067 transitions. Word has length 102 [2024-11-13 14:23:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:23:57,456 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1067 transitions. [2024-11-13 14:23:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:23:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1067 transitions. [2024-11-13 14:23:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:23:57,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:23:57,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:23:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 14:23:57,459 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:23:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:23:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -696893437, now seen corresponding path program 1 times [2024-11-13 14:23:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:23:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676046168] [2024-11-13 14:23:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:23:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:58,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:23:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676046168] [2024-11-13 14:23:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676046168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:23:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897862278] [2024-11-13 14:23:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:23:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:23:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:23:58,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:23:58,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:23:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:58,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 14:23:58,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:23:58,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:23:58,947 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:23:58,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:23:58,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:23:59,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:23:59,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:59,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:59,524 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:59,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 42 treesize of output 41 [2024-11-13 14:23:59,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:59,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:59,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:23:59,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:23:59,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:23:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:23:59,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:59,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2084))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:23:59,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2084))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:24:00,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2088))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2083)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2084)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-13 14:24:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897862278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:00,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-13 14:24:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584013476] [2024-11-13 14:24:00,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:00,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 14:24:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:00,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 14:24:00,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=702, Unknown=52, NotChecked=174, Total=1056 [2024-11-13 14:24:00,235 INFO L87 Difference]: Start difference. First operand 921 states and 1067 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:03,626 INFO L93 Difference]: Finished difference Result 923 states and 1071 transitions. [2024-11-13 14:24:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:24:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-13 14:24:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:03,629 INFO L225 Difference]: With dead ends: 923 [2024-11-13 14:24:03,629 INFO L226 Difference]: Without dead ends: 923 [2024-11-13 14:24:03,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=922, Unknown=55, NotChecked=198, Total=1332 [2024-11-13 14:24:03,630 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 679 mSDsluCounter, 5242 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 5728 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:03,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 5728 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3719 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 14:24:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-13 14:24:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-13 14:24:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 693 states have (on average 1.5281385281385282) internal successors, (1059), 913 states have internal predecessors, (1059), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:24:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1066 transitions. [2024-11-13 14:24:03,638 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1066 transitions. Word has length 103 [2024-11-13 14:24:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:03,638 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1066 transitions. [2024-11-13 14:24:03,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1066 transitions. [2024-11-13 14:24:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:24:03,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:03,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:24:03,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:24:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 14:24:03,840 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:24:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -696893436, now seen corresponding path program 1 times [2024-11-13 14:24:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331176216] [2024-11-13 14:24:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:24:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331176216] [2024-11-13 14:24:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331176216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731896925] [2024-11-13 14:24:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:05,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:05,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:24:05,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:24:05,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:24:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:05,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 14:24:05,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:24:05,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:24:05,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:24:05,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:24:05,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:24:05,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:24:05,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:24:05,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:24:05,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:24:05,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:05,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:24:05,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:06,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:06,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:24:06,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:06,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:06,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:24:06,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:06,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:06,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:24:06,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:06,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:24:06,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:24:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:06,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:24:06,391 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_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2274 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 14:24:06,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2272))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2273) .cse0 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2273) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-13 14:24:06,439 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_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2273) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2272))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2273) .cse2 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-13 14:24:06,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2271))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2270) .cse0 v_ArrVal_2273) (select (select (store .cse1 .cse0 v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2274))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2271))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2272))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2270) .cse3 v_ArrVal_2273) .cse4 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-13 14:24:06,562 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_2270 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2271))) (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_2270) .cse1 v_ArrVal_2273) (select (select (store .cse2 .cse1 v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2274))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2271))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2272))) (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_2270) .cse4 v_ArrVal_2273) .cse5 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-13 14:24:06,706 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2280 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2280))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2271))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2281) .cse0 v_ArrVal_2270) .cse1 v_ArrVal_2273) (select (select (store .cse2 .cse1 v_ArrVal_2272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2274))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2270 (Array Int Int)) (v_ArrVal_2280 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int)) (v_ArrVal_2272 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2280))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2271))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2272))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2281) .cse5 v_ArrVal_2270) .cse6 v_ArrVal_2273) .cse7 v_ArrVal_2274) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-13 14:24:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731896925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:06,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:06,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2024-11-13 14:24:06,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242200527] [2024-11-13 14:24:06,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:06,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:24:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:06,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:24:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=507, Unknown=16, NotChecked=306, Total=930 [2024-11-13 14:24:06,713 INFO L87 Difference]: Start difference. First operand 920 states and 1066 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:10,571 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2024-11-13 14:24:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:24:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-13 14:24:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:10,574 INFO L225 Difference]: With dead ends: 922 [2024-11-13 14:24:10,574 INFO L226 Difference]: Without dead ends: 922 [2024-11-13 14:24:10,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=899, Unknown=17, NotChecked=402, Total=1482 [2024-11-13 14:24:10,575 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 688 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 4076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:10,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 4528 Invalid, 4076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-13 14:24:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-13 14:24:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 904. [2024-11-13 14:24:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 679 states have (on average 1.5360824742268042) internal successors, (1043), 898 states have internal predecessors, (1043), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:24:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1049 transitions. [2024-11-13 14:24:10,586 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1049 transitions. Word has length 103 [2024-11-13 14:24:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:10,586 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1049 transitions. [2024-11-13 14:24:10,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1049 transitions. [2024-11-13 14:24:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 14:24:10,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:10,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:24:10,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 14:24:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 14:24:10,788 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:24:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 37819212, now seen corresponding path program 1 times [2024-11-13 14:24:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536328741] [2024-11-13 14:24:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:24:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536328741] [2024-11-13 14:24:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536328741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:24:11,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:24:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 14:24:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147151529] [2024-11-13 14:24:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:24:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:24:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:24:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:24:11,916 INFO L87 Difference]: Start difference. First operand 904 states and 1049 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:24:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:14,355 INFO L93 Difference]: Finished difference Result 927 states and 1075 transitions. [2024-11-13 14:24:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:24:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-13 14:24:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:14,358 INFO L225 Difference]: With dead ends: 927 [2024-11-13 14:24:14,359 INFO L226 Difference]: Without dead ends: 927 [2024-11-13 14:24:14,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:24:14,360 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 729 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 3098 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:14,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 4772 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3098 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 14:24:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-13 14:24:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 923. [2024-11-13 14:24:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 697 states have (on average 1.5251076040172167) internal successors, (1063), 916 states have internal predecessors, (1063), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:24:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1070 transitions. [2024-11-13 14:24:14,375 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1070 transitions. Word has length 106 [2024-11-13 14:24:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:14,376 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1070 transitions. [2024-11-13 14:24:14,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:24:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1070 transitions. [2024-11-13 14:24:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 14:24:14,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:14,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:24:14,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 14:24:14,378 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:24:14,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash 37819213, now seen corresponding path program 1 times [2024-11-13 14:24:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620823672] [2024-11-13 14:24:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:16,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:24:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:16,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-13 14:24:16,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620823672] [2024-11-13 14:24:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620823672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:24:16,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:24:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 14:24:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738643113] [2024-11-13 14:24:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:24:16,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:24:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:24:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:24:16,093 INFO L87 Difference]: Start difference. First operand 923 states and 1070 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:24:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:19,779 INFO L93 Difference]: Finished difference Result 926 states and 1074 transitions. [2024-11-13 14:24:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:24:19,780 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-13 14:24:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:19,782 INFO L225 Difference]: With dead ends: 926 [2024-11-13 14:24:19,782 INFO L226 Difference]: Without dead ends: 926 [2024-11-13 14:24:19,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:24:19,783 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 727 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 4105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4542 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:19,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4542 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4105 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-13 14:24:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-13 14:24:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2024-11-13 14:24:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 697 states have (on average 1.5236728837876614) internal successors, (1062), 916 states have internal predecessors, (1062), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:24:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1069 transitions. [2024-11-13 14:24:19,791 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1069 transitions. Word has length 106 [2024-11-13 14:24:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:19,792 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1069 transitions. [2024-11-13 14:24:19,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:24:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1069 transitions. [2024-11-13 14:24:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:24:19,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:19,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:24:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 14:24:19,792 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:24:19,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash 850732805, now seen corresponding path program 1 times [2024-11-13 14:24:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827946111] [2024-11-13 14:24:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:24:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827946111] [2024-11-13 14:24:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827946111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605213092] [2024-11-13 14:24:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:20,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:24:20,614 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:24:20,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:24:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:21,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 14:24:21,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:24:21,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:24:21,246 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:24:21,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:24:21,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:24:21,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 14:24:21,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:24:21,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:21,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:24:21,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:21,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:24:21,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:21,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:24:22,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:22,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:24:22,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:24:22,119 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-13 14:24:22,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-13 14:24:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:22,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:24:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605213092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:23,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:23,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-13 14:24:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552902062] [2024-11-13 14:24:23,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:23,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 14:24:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 14:24:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1162, Unknown=56, NotChecked=0, Total=1406 [2024-11-13 14:24:23,378 INFO L87 Difference]: Start difference. First operand 923 states and 1069 transitions. Second operand has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:27,651 INFO L93 Difference]: Finished difference Result 925 states and 1073 transitions. [2024-11-13 14:24:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:24:27,652 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-13 14:24:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:27,653 INFO L225 Difference]: With dead ends: 925 [2024-11-13 14:24:27,653 INFO L226 Difference]: Without dead ends: 925 [2024-11-13 14:24:27,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=1446, Unknown=56, NotChecked=0, Total=1722 [2024-11-13 14:24:27,655 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 678 mSDsluCounter, 6613 mSDsCounter, 0 mSdLazyCounter, 4609 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 7098 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:27,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 7098 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4609 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-13 14:24:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-13 14:24:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 922. [2024-11-13 14:24:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 697 states have (on average 1.5222381635581061) internal successors, (1061), 915 states have internal predecessors, (1061), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:24:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1068 transitions. [2024-11-13 14:24:27,669 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1068 transitions. Word has length 107 [2024-11-13 14:24:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:27,670 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1068 transitions. [2024-11-13 14:24:27,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:24:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1068 transitions. [2024-11-13 14:24:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:24:27,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:27,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:24:27,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:24:27,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-13 14:24:27,872 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:24:27,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash 850732806, now seen corresponding path program 1 times [2024-11-13 14:24:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870968347] [2024-11-13 14:24:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:29,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:24:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:24:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870968347] [2024-11-13 14:24:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870968347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884690230] [2024-11-13 14:24:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:29,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:24:29,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:24:29,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:24:29,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:24:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:24:29,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 14:24:29,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:24:29,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:24:30,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:24:30,030 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:24:30,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:24:30,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:24:30,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:24:30,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-13 14:24:30,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-13 14:24:30,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:30,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:24:30,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:30,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:30,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:24:30,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:30,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:30,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:24:30,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:31,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:31,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:24:31,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:31,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:24:31,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:24:31,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:24:31,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-13 14:24:31,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:24:31,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:24:31,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 14:24:31,351 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 14:24:31,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 14:24:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:24:31,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:24:32,087 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 (or (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2859 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2859) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2860 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2862 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2858))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2859) .cse2 v_ArrVal_2861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2862) (select (select (store .cse3 .cse2 v_ArrVal_2860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-13 14:24:58,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884690230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:24:58,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-13 14:24:58,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810655570] [2024-11-13 14:24:58,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 14:24:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:24:58,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 14:24:58,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1416, Unknown=57, NotChecked=78, Total=1722 [2024-11-13 14:24:58,116 INFO L87 Difference]: Start difference. First operand 922 states and 1068 transitions. Second operand has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:25:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:25:38,794 INFO L93 Difference]: Finished difference Result 924 states and 1072 transitions. [2024-11-13 14:25:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:25:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-13 14:25:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:25:38,797 INFO L225 Difference]: With dead ends: 924 [2024-11-13 14:25:38,797 INFO L226 Difference]: Without dead ends: 924 [2024-11-13 14:25:38,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=298, Invalid=2299, Unknown=59, NotChecked=100, Total=2756 [2024-11-13 14:25:38,798 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 679 mSDsluCounter, 7492 mSDsCounter, 0 mSdLazyCounter, 7482 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 7977 SdHoareTripleChecker+Invalid, 7502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:25:38,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 7977 Invalid, 7502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7482 Invalid, 0 Unknown, 0 Unchecked, 37.9s Time] [2024-11-13 14:25:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-13 14:25:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 902. [2024-11-13 14:25:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 679 states have (on average 1.533136966126657) internal successors, (1041), 896 states have internal predecessors, (1041), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:25:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1047 transitions. [2024-11-13 14:25:38,807 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1047 transitions. Word has length 107 [2024-11-13 14:25:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:25:38,807 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1047 transitions. [2024-11-13 14:25:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:25:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1047 transitions. [2024-11-13 14:25:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:25:38,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:25:38,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:25:38,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 14:25:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 14:25:39,009 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:25:39,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:25:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1391373520, now seen corresponding path program 1 times [2024-11-13 14:25:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:25:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962188859] [2024-11-13 14:25:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:25:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:25:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:39,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:25:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:25:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:25:39,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962188859] [2024-11-13 14:25:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962188859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:25:39,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:25:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:25:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480669163] [2024-11-13 14:25:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:25:39,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:25:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:25:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:25:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:25:39,954 INFO L87 Difference]: Start difference. First operand 902 states and 1047 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:25:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:25:45,601 INFO L93 Difference]: Finished difference Result 907 states and 1055 transitions. [2024-11-13 14:25:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:25:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-13 14:25:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:25:45,606 INFO L225 Difference]: With dead ends: 907 [2024-11-13 14:25:45,606 INFO L226 Difference]: Without dead ends: 907 [2024-11-13 14:25:45,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:25:45,607 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 6 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:25:45,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3631 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-13 14:25:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-13 14:25:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 901. [2024-11-13 14:25:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 679 states have (on average 1.5316642120765833) internal successors, (1040), 895 states have internal predecessors, (1040), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:25:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1046 transitions. [2024-11-13 14:25:45,627 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1046 transitions. Word has length 109 [2024-11-13 14:25:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:25:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1046 transitions. [2024-11-13 14:25:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:25:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1046 transitions. [2024-11-13 14:25:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:25:45,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:25:45,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:25:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 14:25:45,630 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:25:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:25:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1391373521, now seen corresponding path program 1 times [2024-11-13 14:25:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:25:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316598461] [2024-11-13 14:25:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:25:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:25:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:25:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:25:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:25:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316598461] [2024-11-13 14:25:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316598461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:25:49,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:25:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 14:25:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078450306] [2024-11-13 14:25:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:25:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:25:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:25:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:25:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:25:49,738 INFO L87 Difference]: Start difference. First operand 901 states and 1046 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:26:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:26:05,570 INFO L93 Difference]: Finished difference Result 926 states and 1074 transitions. [2024-11-13 14:26:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:26:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-13 14:26:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:26:05,572 INFO L225 Difference]: With dead ends: 926 [2024-11-13 14:26:05,573 INFO L226 Difference]: Without dead ends: 926 [2024-11-13 14:26:05,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-13 14:26:05,573 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 709 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 3436 SdHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:26:05,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 3436 Invalid, 2925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-11-13 14:26:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-13 14:26:05,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2024-11-13 14:26:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 700 states have (on average 1.5171428571428571) internal successors, (1062), 916 states have internal predecessors, (1062), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:26:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1069 transitions. [2024-11-13 14:26:05,587 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1069 transitions. Word has length 109 [2024-11-13 14:26:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:26:05,587 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1069 transitions. [2024-11-13 14:26:05,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:26:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1069 transitions. [2024-11-13 14:26:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:26:05,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:26:05,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:26:05,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 14:26:05,588 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:26:05,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:26:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash -420359560, now seen corresponding path program 1 times [2024-11-13 14:26:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:26:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839858959] [2024-11-13 14:26:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:26:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:08,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:26:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:26:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:26:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839858959] [2024-11-13 14:26:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839858959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:26:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339721248] [2024-11-13 14:26:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:26:08,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:26:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:26:08,949 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:26:08,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:26:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:26:09,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 14:26:09,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:26:09,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:26:10,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:26:10,131 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 14:26:10,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 14:26:10,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:26:10,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:26:10,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-13 14:26:10,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:26:11,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:26:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:26:11,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:26:12,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:26:12,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:26:12,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:26:13,151 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:26:13,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:26:13,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:26:13,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:26:13,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:26:13,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:26:14,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:26:14,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 14:26:14,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:26:14,821 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-13 14:26:14,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-13 14:26:14,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-13 14:26:15,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:26:15,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:26:15,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:26:15,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:26:15,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:26:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:26:15,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:26:16,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3273 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3273 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-13 14:26:16,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3270))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3269) .cse0 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse2 .cse0 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3269) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 14:26:18,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3266))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3265) .cse0 v_ArrVal_3267) .cse1 v_ArrVal_3269) (select (select (store .cse2 .cse1 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3273))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3266))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3268))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3270))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3265) .cse5 v_ArrVal_3267) .cse6 v_ArrVal_3269) .cse7 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse8 .cse7 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-13 14:26:37,343 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3263))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3266))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3268))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3270))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3264) .cse1 v_ArrVal_3265) .cse2 v_ArrVal_3267) .cse3 v_ArrVal_3269) .cse4 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse6 .cse4 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (or (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3263))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3266))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3268))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3264) .cse10 v_ArrVal_3265) .cse11 v_ArrVal_3267) .cse12 v_ArrVal_3269) (select (select (store .cse13 .cse12 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3273))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-11-13 14:26:37,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3278 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3279 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (or (forall ((v_ArrVal_3272 (Array Int Int)) (v_ArrVal_3271 Int) (v_ArrVal_3273 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3279))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3263))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3266))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3268))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_3270))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3278) .cse0 v_ArrVal_3264) .cse1 v_ArrVal_3265) .cse2 v_ArrVal_3267) .cse3 v_ArrVal_3269) .cse4 v_ArrVal_3273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3271) (select (select (store .cse6 .cse4 v_ArrVal_3272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3273 (Array Int Int)) (v_ArrVal_3263 (Array Int Int)) (v_ArrVal_3264 (Array Int Int)) (v_ArrVal_3265 (Array Int Int)) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3278 (Array Int Int)) (v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3279 (Array Int Int)) (v_ArrVal_3268 (Array Int Int)) (v_ArrVal_3269 (Array Int Int)) (v_ArrVal_3270 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3279))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_3263))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3266))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3268))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3278) .cse11 v_ArrVal_3264) .cse12 v_ArrVal_3265) .cse13 v_ArrVal_3267) .cse14 v_ArrVal_3269) (select (select (store .cse15 .cse14 v_ArrVal_3270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3273))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-13 14:26:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339721248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:26:37,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:26:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2024-11-13 14:26:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733069443] [2024-11-13 14:26:37,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:26:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 14:26:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:26:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 14:26:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1467, Unknown=43, NotChecked=420, Total=2162 [2024-11-13 14:26:37,828 INFO L87 Difference]: Start difference. First operand 923 states and 1069 transitions. Second operand has 33 states, 30 states have (on average 6.0) internal successors, (180), 32 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:27:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:26,930 INFO L93 Difference]: Finished difference Result 925 states and 1073 transitions. [2024-11-13 14:27:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:27:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.0) internal successors, (180), 32 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-13 14:27:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:26,932 INFO L225 Difference]: With dead ends: 925 [2024-11-13 14:27:26,932 INFO L226 Difference]: Without dead ends: 925 [2024-11-13 14:27:26,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=386, Invalid=2453, Unknown=43, NotChecked=540, Total=3422 [2024-11-13 14:27:26,934 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 673 mSDsluCounter, 6407 mSDsCounter, 0 mSdLazyCounter, 6415 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 6891 SdHoareTripleChecker+Invalid, 6435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:26,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 6891 Invalid, 6435 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6415 Invalid, 0 Unknown, 0 Unchecked, 45.4s Time] [2024-11-13 14:27:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-13 14:27:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 900. [2024-11-13 14:27:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 679 states have (on average 1.5301914580265095) internal successors, (1039), 894 states have internal predecessors, (1039), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:27:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1045 transitions. [2024-11-13 14:27:26,948 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1045 transitions. Word has length 110 [2024-11-13 14:27:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:26,948 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1045 transitions. [2024-11-13 14:27:26,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.0) internal successors, (180), 32 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:27:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1045 transitions. [2024-11-13 14:27:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:27:26,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:26,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:27:26,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:27:27,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:27:27,150 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:27:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -320172045, now seen corresponding path program 1 times [2024-11-13 14:27:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:27:27,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278599069] [2024-11-13 14:27:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:27:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:27:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:27:30,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:27:30,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278599069] [2024-11-13 14:27:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278599069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:30,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 14:27:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335097587] [2024-11-13 14:27:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:30,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:27:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:27:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:27:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:27:30,048 INFO L87 Difference]: Start difference. First operand 900 states and 1045 transitions. Second operand has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:27:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:51,057 INFO L93 Difference]: Finished difference Result 951 states and 1101 transitions. [2024-11-13 14:27:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:27:51,058 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 14:27:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:51,060 INFO L225 Difference]: With dead ends: 951 [2024-11-13 14:27:51,060 INFO L226 Difference]: Without dead ends: 951 [2024-11-13 14:27:51,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:27:51,061 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 819 mSDsluCounter, 3880 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:51,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 4366 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2024-11-13 14:27:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-13 14:27:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 925. [2024-11-13 14:27:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 703 states have (on average 1.5149359886201992) internal successors, (1065), 918 states have internal predecessors, (1065), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:27:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1072 transitions. [2024-11-13 14:27:51,071 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1072 transitions. Word has length 112 [2024-11-13 14:27:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:51,071 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1072 transitions. [2024-11-13 14:27:51,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:27:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1072 transitions. [2024-11-13 14:27:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:27:51,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:51,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:27:51,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 14:27:51,073 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:27:51,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash -320172044, now seen corresponding path program 1 times [2024-11-13 14:27:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:27:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457026491] [2024-11-13 14:27:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:27:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:27:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:27:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:27:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:27:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457026491] [2024-11-13 14:27:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457026491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 14:27:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049110434] [2024-11-13 14:27:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:27:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:27:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:27:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:27:54,765 INFO L87 Difference]: Start difference. First operand 925 states and 1072 transitions. Second operand has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:28:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:28:25,609 INFO L93 Difference]: Finished difference Result 950 states and 1100 transitions. [2024-11-13 14:28:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:28:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-13 14:28:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:28:25,614 INFO L225 Difference]: With dead ends: 950 [2024-11-13 14:28:25,614 INFO L226 Difference]: Without dead ends: 950 [2024-11-13 14:28:25,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-13 14:28:25,615 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 760 mSDsluCounter, 5557 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 6047 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:28:25,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 6047 Invalid, 4280 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 29.2s Time] [2024-11-13 14:28:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-13 14:28:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 925. [2024-11-13 14:28:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 703 states have (on average 1.5135135135135136) internal successors, (1064), 918 states have internal predecessors, (1064), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:28:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1071 transitions. [2024-11-13 14:28:25,628 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1071 transitions. Word has length 112 [2024-11-13 14:28:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:28:25,629 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1071 transitions. [2024-11-13 14:28:25,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:28:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1071 transitions. [2024-11-13 14:28:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:28:25,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:28:25,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:28:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 14:28:25,631 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:28:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:28:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1193620716, now seen corresponding path program 1 times [2024-11-13 14:28:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:28:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796762519] [2024-11-13 14:28:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:28:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:28:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:28:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:28:29,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:28:29,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796762519] [2024-11-13 14:28:29,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796762519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:28:29,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017680773] [2024-11-13 14:28:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:28:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:28:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:28:29,627 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:28:29,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:28:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:28:30,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 14:28:30,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:28:30,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:28:31,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:28:31,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:28:31,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:28:31,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:31,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 14:28:32,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:32,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 14:28:32,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:32,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 14:28:33,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:33,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 14:28:33,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:33,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 14:28:33,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:33,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:28:34,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:28:34,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 14:28:34,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:28:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:28:34,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:28:34,976 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-13 14:28:34,977 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-13 14:28:35,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem60#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-13 14:28:35,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3696)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3697))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-13 14:28:35,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3696))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3697))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 14:28:35,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3695))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:28:35,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:28:35,647 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3694))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:28:35,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3694))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:28:35,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3693))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3694)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:28:35,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3693))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3694)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3696)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3697))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-13 14:28:36,155 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3693 (Array Int Int)) (v_ArrVal_3694 (Array Int Int)) (v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3696 (Array Int Int)) (v_ArrVal_3697 (Array Int Int)) (v_ArrVal_3698 (Array Int Int)) (v_ArrVal_3701 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3701))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3693)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3694)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3695)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3696)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3697))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3698)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-13 14:28:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017680773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:28:36,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:28:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 24 [2024-11-13 14:28:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966317206] [2024-11-13 14:28:36,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:28:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 14:28:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:28:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 14:28:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=653, Unknown=27, NotChecked=610, Total=1406 [2024-11-13 14:28:36,166 INFO L87 Difference]: Start difference. First operand 925 states and 1071 transitions. Second operand has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:29:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:29:02,022 INFO L93 Difference]: Finished difference Result 941 states and 1089 transitions. [2024-11-13 14:29:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:29:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-13 14:29:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:29:02,027 INFO L225 Difference]: With dead ends: 941 [2024-11-13 14:29:02,027 INFO L226 Difference]: Without dead ends: 941 [2024-11-13 14:29:02,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=220, Invalid=1274, Unknown=28, NotChecked=830, Total=2352 [2024-11-13 14:29:02,029 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 775 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:29:02,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 4835 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2024-11-13 14:29:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-13 14:29:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 924. [2024-11-13 14:29:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 703 states have (on average 1.5120910384068278) internal successors, (1063), 917 states have internal predecessors, (1063), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 14:29:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1070 transitions. [2024-11-13 14:29:02,043 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1070 transitions. Word has length 113 [2024-11-13 14:29:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:29:02,043 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1070 transitions. [2024-11-13 14:29:02,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 7.217391304347826) internal successors, (166), 24 states have internal predecessors, (166), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:29:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1070 transitions. [2024-11-13 14:29:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:29:02,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:29:02,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:29:02,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 14:29:02,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:29:02,245 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:29:02,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:29:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1193620717, now seen corresponding path program 1 times [2024-11-13 14:29:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:29:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700897610] [2024-11-13 14:29:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:29:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:05,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:29:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:29:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:29:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700897610] [2024-11-13 14:29:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700897610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:29:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96723067] [2024-11-13 14:29:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:06,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:29:06,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:29:06,468 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:29:06,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:29:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:06,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 14:29:06,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:29:07,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:29:08,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:29:08,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:29:08,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:29:08,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:29:09,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:09,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:29:09,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:09,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:09,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:29:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:10,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:10,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:29:10,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:10,592 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:10,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:29:10,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:11,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:11,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:29:11,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:11,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:11,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:29:11,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:12,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:29:12,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 14:29:12,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 14:29:12,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 14:29:12,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 14:29:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:29:13,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:29:13,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3933 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 14:29:13,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3933 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-13 14:29:14,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:29:14,045 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-13 14:29:14,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3931) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)) (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem60#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3930))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_prenex_44) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-13 14:29:14,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_44) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_45) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3931) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3930))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-13 14:29:14,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3929))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3928) .cse0 v_prenex_44) (select (select (store .cse1 .cse0 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3929))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3928) .cse3 v_ArrVal_3931) (select (select (store .cse4 .cse3 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3933))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3929))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_3930))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse7)))))) is different from false [2024-11-13 14:29:14,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3929))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3930))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3929))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3928) .cse5 v_prenex_44) (select (select (store .cse6 .cse5 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3929))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3928) .cse7 v_ArrVal_3931) (select (select (store .cse8 .cse7 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3933))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2024-11-13 14:29:14,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3927))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3929))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3926) .cse0 v_ArrVal_3928) .cse1 v_ArrVal_3931) (select (select (store .cse2 .cse1 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3933))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3927))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3929))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3926) .cse5 v_ArrVal_3928) .cse6 v_prenex_44) (select (select (store .cse7 .cse6 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_45))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3927))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3929)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3930))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-13 14:29:15,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int))) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3927))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3929))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3926) .cse1 v_ArrVal_3928) .cse2 v_ArrVal_3931) (select (select (store .cse3 .cse2 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3933))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3927))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3929))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3926) .cse6 v_ArrVal_3928) .cse7 v_prenex_44) (select (select (store .cse8 .cse7 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_45))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3927))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3929)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3930))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse12))))))) is different from false [2024-11-13 14:29:15,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3925))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3927))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3929))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3924) .cse0 v_ArrVal_3926) .cse1 v_ArrVal_3928) .cse2 v_ArrVal_3931) (select (select (store .cse3 .cse2 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3933))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3925))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3927)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3929)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse7 (store .cse8 .cse9 v_ArrVal_3930))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse9)))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3925))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_3927))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_3929))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3924) .cse12 v_ArrVal_3926) .cse13 v_ArrVal_3928) .cse14 v_prenex_44) (select (select (store .cse15 .cse14 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_45))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) is different from false [2024-11-13 14:29:21,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3923))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3925))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3927))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3929))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3922) .cse0 v_ArrVal_3924) .cse1 v_ArrVal_3926) .cse2 v_ArrVal_3928) .cse3 v_prenex_44) (select (select (store .cse4 .cse3 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_45))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3923))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3925)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3927)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3929)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3930))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3923))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3925))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3927))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3929))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3922) .cse15 v_ArrVal_3924) .cse16 v_ArrVal_3926) .cse17 v_ArrVal_3928) .cse18 v_ArrVal_3931) (select (select (store .cse19 .cse18 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3933))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)))) is different from false [2024-11-13 14:29:26,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3923))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3925)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3927)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3929)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3930))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3923))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3925))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3927))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3929))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3922) .cse8 v_ArrVal_3924) .cse9 v_ArrVal_3926) .cse10 v_ArrVal_3928) .cse11 v_prenex_44) (select (select (store .cse12 .cse11 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_45))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_3923))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_3925))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_3927))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_3929))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_3922) .cse16 v_ArrVal_3924) .cse17 v_ArrVal_3926) .cse18 v_ArrVal_3928) .cse19 v_ArrVal_3931) (select (select (store .cse20 .cse19 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3933))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2024-11-13 14:29:32,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3932 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3939))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3923)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3925)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3927)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3929)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3930))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3932)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3930 (Array Int Int)) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3933 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (< (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3939))) (let ((.cse8 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse8 v_ArrVal_3923))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_3925))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_3927))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3929))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3938) .cse8 v_ArrVal_3922) .cse9 v_ArrVal_3924) .cse10 v_ArrVal_3926) .cse11 v_ArrVal_3928) .cse12 v_ArrVal_3931) (select (select (store .cse13 .cse12 v_ArrVal_3930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3933))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3938 (Array Int Int)) (v_ArrVal_3927 (Array Int Int)) (v_ArrVal_3939 (Array Int Int)) (v_ArrVal_3928 (Array Int Int)) (v_ArrVal_3929 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_3922 (Array Int Int)) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (<= 0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3939))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse27 .cse18 v_ArrVal_3923))) (let ((.cse19 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse26 .cse19 v_ArrVal_3925))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse25 .cse20 v_ArrVal_3927))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_3929))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3938) .cse18 v_ArrVal_3922) .cse19 v_ArrVal_3924) .cse20 v_ArrVal_3926) .cse21 v_ArrVal_3928) .cse22 v_prenex_44) (select (select (store .cse23 .cse22 v_prenex_43) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_45))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 14:29:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96723067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:29:32,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:29:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 27 [2024-11-13 14:29:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498082101] [2024-11-13 14:29:32,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:29:32,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 14:29:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:29:32,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 14:29:32,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=828, Unknown=18, NotChecked=828, Total=1806 [2024-11-13 14:29:32,370 INFO L87 Difference]: Start difference. First operand 924 states and 1070 transitions. Second operand has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:30:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:16,752 INFO L93 Difference]: Finished difference Result 940 states and 1088 transitions. [2024-11-13 14:30:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:30:16,753 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-13 14:30:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:16,756 INFO L225 Difference]: With dead ends: 940 [2024-11-13 14:30:16,756 INFO L226 Difference]: Without dead ends: 940 [2024-11-13 14:30:16,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=244, Invalid=1592, Unknown=18, NotChecked=1116, Total=2970 [2024-11-13 14:30:16,758 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 763 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 4987 SdHoareTripleChecker+Invalid, 3858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:16,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 4987 Invalid, 3858 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 40.7s Time] [2024-11-13 14:30:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-13 14:30:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 898. [2024-11-13 14:30:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 679 states have (on average 1.5272459499263622) internal successors, (1037), 892 states have internal predecessors, (1037), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:30:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1043 transitions. [2024-11-13 14:30:16,772 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1043 transitions. Word has length 113 [2024-11-13 14:30:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:16,773 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1043 transitions. [2024-11-13 14:30:16,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 27 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:30:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1043 transitions. [2024-11-13 14:30:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:30:16,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:16,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:16,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:30:16,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:30:16,975 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:30:16,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash 877659012, now seen corresponding path program 1 times [2024-11-13 14:30:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:16,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916174880] [2024-11-13 14:30:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:30:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:30:17,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:17,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916174880] [2024-11-13 14:30:17,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916174880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:17,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:17,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:30:17,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088050464] [2024-11-13 14:30:17,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:17,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:30:17,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:30:17,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:30:17,732 INFO L87 Difference]: Start difference. First operand 898 states and 1043 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:30:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:27,336 INFO L93 Difference]: Finished difference Result 917 states and 1065 transitions. [2024-11-13 14:30:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:30:27,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-13 14:30:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:27,338 INFO L225 Difference]: With dead ends: 917 [2024-11-13 14:30:27,338 INFO L226 Difference]: Without dead ends: 917 [2024-11-13 14:30:27,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:30:27,338 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 22 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:27,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2960 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-13 14:30:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-13 14:30:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 897. [2024-11-13 14:30:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 679 states have (on average 1.5257731958762886) internal successors, (1036), 891 states have internal predecessors, (1036), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:30:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1042 transitions. [2024-11-13 14:30:27,346 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1042 transitions. Word has length 115 [2024-11-13 14:30:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:27,346 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1042 transitions. [2024-11-13 14:30:27,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:30:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1042 transitions. [2024-11-13 14:30:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:30:27,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:27,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:27,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-13 14:30:27,347 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:30:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 877659013, now seen corresponding path program 1 times [2024-11-13 14:30:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069630427] [2024-11-13 14:30:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:30:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:27,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-13 14:30:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069630427] [2024-11-13 14:30:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069630427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:27,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:27,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:30:27,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085249185] [2024-11-13 14:30:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:27,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:30:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:30:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:30:27,997 INFO L87 Difference]: Start difference. First operand 897 states and 1042 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:30:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:30:37,951 INFO L93 Difference]: Finished difference Result 916 states and 1064 transitions. [2024-11-13 14:30:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:30:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-13 14:30:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:30:37,953 INFO L225 Difference]: With dead ends: 916 [2024-11-13 14:30:37,953 INFO L226 Difference]: Without dead ends: 916 [2024-11-13 14:30:37,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:30:37,953 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 21 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:30:37,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2940 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2024-11-13 14:30:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2024-11-13 14:30:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 896. [2024-11-13 14:30:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 679 states have (on average 1.524300441826215) internal successors, (1035), 890 states have internal predecessors, (1035), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:30:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1041 transitions. [2024-11-13 14:30:37,965 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1041 transitions. Word has length 115 [2024-11-13 14:30:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:30:37,965 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1041 transitions. [2024-11-13 14:30:37,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:30:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1041 transitions. [2024-11-13 14:30:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:30:37,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:30:37,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:30:37,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-13 14:30:37,967 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:30:37,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:30:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1437626295, now seen corresponding path program 1 times [2024-11-13 14:30:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:30:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630735670] [2024-11-13 14:30:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:30:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:30:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:30:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:30:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:30:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:30:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630735670] [2024-11-13 14:30:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630735670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:30:44,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:30:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 14:30:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362035187] [2024-11-13 14:30:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:30:44,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:30:44,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:30:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:30:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:30:44,172 INFO L87 Difference]: Start difference. First operand 896 states and 1041 transitions. Second operand has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:31:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:36,355 INFO L93 Difference]: Finished difference Result 944 states and 1094 transitions. [2024-11-13 14:31:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:31:36,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-13 14:31:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:36,358 INFO L225 Difference]: With dead ends: 944 [2024-11-13 14:31:36,358 INFO L226 Difference]: Without dead ends: 944 [2024-11-13 14:31:36,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:31:36,359 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 729 mSDsluCounter, 6689 mSDsCounter, 0 mSdLazyCounter, 4636 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 7181 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:36,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 7181 Invalid, 4652 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 4636 Invalid, 0 Unknown, 0 Unchecked, 49.0s Time] [2024-11-13 14:31:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-13 14:31:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 925. [2024-11-13 14:31:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 707 states have (on average 1.504950495049505) internal successors, (1064), 918 states have internal predecessors, (1064), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 14:31:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2024-11-13 14:31:36,380 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 116 [2024-11-13 14:31:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:36,380 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2024-11-13 14:31:36,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:31:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2024-11-13 14:31:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:31:36,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:36,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:36,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-13 14:31:36,383 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:31:36,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1437626296, now seen corresponding path program 1 times [2024-11-13 14:31:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:36,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825753915] [2024-11-13 14:31:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:31:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:31:43,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:43,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825753915] [2024-11-13 14:31:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825753915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 14:31:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923632832] [2024-11-13 14:31:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:31:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:31:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:31:43,532 INFO L87 Difference]: Start difference. First operand 925 states and 1073 transitions. Second operand has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:32:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:32:33,739 INFO L93 Difference]: Finished difference Result 943 states and 1093 transitions. [2024-11-13 14:32:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:32:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-13 14:32:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:32:33,742 INFO L225 Difference]: With dead ends: 943 [2024-11-13 14:32:33,742 INFO L226 Difference]: Without dead ends: 943 [2024-11-13 14:32:33,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:32:33,743 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 747 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 4180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 5399 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:32:33,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 5399 Invalid, 4198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 4180 Invalid, 0 Unknown, 0 Unchecked, 46.6s Time] [2024-11-13 14:32:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-13 14:32:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 925. [2024-11-13 14:32:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 706 states have (on average 1.5056657223796035) internal successors, (1063), 918 states have internal predecessors, (1063), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 14:32:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1072 transitions. [2024-11-13 14:32:33,756 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1072 transitions. Word has length 116 [2024-11-13 14:32:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:32:33,756 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1072 transitions. [2024-11-13 14:32:33,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 14:32:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1072 transitions. [2024-11-13 14:32:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:32:33,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:32:33,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:32:33,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-13 14:32:33,758 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:32:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:32:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 397275184, now seen corresponding path program 1 times [2024-11-13 14:32:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:32:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229713007] [2024-11-13 14:32:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:32:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:32:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:32:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:32:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229713007] [2024-11-13 14:32:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229713007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:32:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363389127] [2024-11-13 14:32:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:32:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:32:41,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:32:41,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:32:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:42,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 14:32:42,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:32:42,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:32:44,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:32:44,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:32:44,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:32:44,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:32:45,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:32:45,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:32:45,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:32:46,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:32:46,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:32:46,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:32:46,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:32:46,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:32:46,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:32:47,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:32:47,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:32:47,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:32:48,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:32:48,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:32:48,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:32:48,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:32:49,646 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 14:32:49,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 63 [2024-11-13 14:32:49,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-13 14:32:50,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:32:51,089 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 14:32:51,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-13 14:32:51,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-13 14:32:51,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 14:32:52,009 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 14:32:52,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-13 14:32:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:32:52,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:32:52,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int)) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1)) is different from false [2024-11-13 14:32:52,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (= (select |c_#valid| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-13 14:32:53,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 446 treesize of output 300 [2024-11-13 14:32:54,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4563)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-13 14:32:59,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4558))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-13 14:33:04,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4557)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_4558))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4556) .cse8 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-13 14:33:04,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4557))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4558))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4556) .cse9 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-13 14:33:04,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4555)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_4557))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_4558))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4554) .cse8 v_ArrVal_4556) .cse9 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-13 14:33:04,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4566 Int) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4555))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4557))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4558))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4554) .cse9 v_ArrVal_4556) .cse10 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-13 14:33:04,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4552 (Array Int Int)) (v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4553 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4553)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_4555))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4557))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_4558))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4552) .cse8 v_ArrVal_4554) .cse9 v_ArrVal_4556) .cse10 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-13 14:33:04,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4552 (Array Int Int)) (v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4553 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4553))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4555))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4557))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4558))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4552) .cse9 v_ArrVal_4554) .cse10 v_ArrVal_4556) .cse11 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse7 .cse6 v_ArrVal_4563))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))) is different from false [2024-11-13 14:33:05,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4566 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_14| Int) (v_ArrVal_4571 (Array Int Int)) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4552 (Array Int Int)) (v_ArrVal_4563 (Array Int Int)) (v_ArrVal_4553 (Array Int Int)) (v_ArrVal_4554 (Array Int Int)) (v_ArrVal_4565 (Array Int Int)) (v_ArrVal_4555 (Array Int Int)) (v_ArrVal_4556 (Array Int Int)) (v_ArrVal_4557 (Array Int Int)) (v_ArrVal_4558 (Array Int Int)) (v_ArrVal_4559 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4572)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_4553))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4555))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4557))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse12 .cse11 v_ArrVal_4558))) (let ((.cse7 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4571) .cse8 v_ArrVal_4552) .cse9 v_ArrVal_4554) .cse10 v_ArrVal_4556) .cse11 v_ArrVal_4559)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_4563))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_16| (let ((.cse2 (store .cse5 .cse6 (store (select .cse5 .cse6) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_14| 40) v_ArrVal_4566)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-13 14:33:05,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363389127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:33:05,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:33:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2024-11-13 14:33:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530892160] [2024-11-13 14:33:05,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:33:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 14:33:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 14:33:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1175, Unknown=37, NotChecked=880, Total=2256 [2024-11-13 14:33:05,277 INFO L87 Difference]: Start difference. First operand 925 states and 1072 transitions. Second operand has 34 states, 31 states have (on average 6.096774193548387) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:34:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:34:02,643 INFO L93 Difference]: Finished difference Result 941 states and 1091 transitions. [2024-11-13 14:34:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 14:34:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 6.096774193548387) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2024-11-13 14:34:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:34:02,645 INFO L225 Difference]: With dead ends: 941 [2024-11-13 14:34:02,645 INFO L226 Difference]: Without dead ends: 941 [2024-11-13 14:34:02,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=296, Invalid=2260, Unknown=38, NotChecked=1188, Total=3782 [2024-11-13 14:34:02,646 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 723 mSDsluCounter, 7656 mSDsCounter, 0 mSdLazyCounter, 5237 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 8140 SdHoareTripleChecker+Invalid, 5260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5237 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:34:02,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 8140 Invalid, 5260 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 5237 Invalid, 2 Unknown, 0 Unchecked, 52.3s Time] [2024-11-13 14:34:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-13 14:34:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 924. [2024-11-13 14:34:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 706 states have (on average 1.5042492917847026) internal successors, (1062), 917 states have internal predecessors, (1062), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-13 14:34:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1071 transitions. [2024-11-13 14:34:02,657 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1071 transitions. Word has length 117 [2024-11-13 14:34:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:34:02,657 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1071 transitions. [2024-11-13 14:34:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 6.096774193548387) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:34:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1071 transitions. [2024-11-13 14:34:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:34:02,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:34:02,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:34:02,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:34:02,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:34:02,859 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:34:02,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:34:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 397275185, now seen corresponding path program 1 times [2024-11-13 14:34:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:34:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344543539] [2024-11-13 14:34:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:02,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:34:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:34:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:34:11,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:34:11,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344543539] [2024-11-13 14:34:11,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344543539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:34:11,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159899980] [2024-11-13 14:34:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:34:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:34:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:34:11,201 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:34:11,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:34:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:34:11,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-13 14:34:11,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:34:11,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:34:13,386 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:34:13,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:34:13,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:34:13,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 14:34:14,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:34:14,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:34:14,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:34:15,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:34:15,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:34:15,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:34:15,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:34:15,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:34:16,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:34:16,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:34:16,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:34:16,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:34:17,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 14:34:17,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-13 14:34:17,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-13 14:34:18,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:34:19,164 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-13 14:34:19,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-13 14:34:19,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-13 14:34:20,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:34:20,837 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-13 14:34:20,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-13 14:34:20,986 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-13 14:34:20,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-13 14:34:22,080 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-13 14:34:22,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-13 14:34:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:34:22,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:34:24,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse1 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int))) (or (not (= v_ArrVal_4807 (store .cse0 .cse1 (select v_ArrVal_4807 .cse1)))) (forall ((v_ArrVal_4808 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4807)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse7 .cse1 v_ArrVal_4808)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (<= (+ 384 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))))) (forall ((v_ArrVal_4807 (Array Int Int))) (or (not (= v_ArrVal_4807 (store .cse0 .cse1 (select v_ArrVal_4807 .cse1)))) (forall ((v_ArrVal_4808 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4807))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse7 .cse1 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2024-11-13 14:34:24,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| .cse6)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse0) (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (forall ((v_ArrVal_4808 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4807)) (.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 .cse8 v_ArrVal_4808)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select .cse1 .cse2) .cse3) 384) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (= (store .cse9 .cse8 (select v_ArrVal_4807 .cse8)) v_ArrVal_4807))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store .cse9 .cse10 (select v_ArrVal_4807 .cse10)) v_ArrVal_4807)) (forall ((v_ArrVal_4808 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4807))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 (store .cse7 .cse10 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse0))))))) is different from false [2024-11-13 14:34:25,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (select .cse7 .cse8)) (.cse0 (select .cse10 .cse8)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4807 .cse1)) v_ArrVal_4807)) (forall ((v_ArrVal_4808 Int)) (let ((.cse2 (store .cse10 .cse8 v_ArrVal_4807)) (.cse5 (store .cse7 .cse8 (store .cse9 .cse1 v_ArrVal_4808)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (<= (+ (select (select .cse2 .cse3) .cse4) 384) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse11))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int)) (or (forall ((v_ArrVal_4807 (Array Int Int))) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (forall ((v_ArrVal_4808 Int)) (<= 0 (let ((.cse12 (store .cse10 .cse8 v_ArrVal_4807))) (select (select .cse12 (select (select (store .cse7 .cse8 (store .cse9 .cse13 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))) (not (= (store .cse0 .cse13 (select v_ArrVal_4807 .cse13)) v_ArrVal_4807))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse11))))))) is different from false [2024-11-13 14:34:25,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 791 [2024-11-13 14:34:26,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4807 .cse2)) v_ArrVal_4807)) (< (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4807))) (select (select .cse3 (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse6))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse8) .cse9 (select v_ArrVal_4807 .cse9)) v_ArrVal_4807)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| .cse6) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse10 (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 v_ArrVal_4808)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse0 .cse8 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse13 (+ 40 v_prenex_64)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (< v_prenex_64 .cse6) (not (= v_prenex_63 (store (select .cse0 .cse12) .cse13 (select v_prenex_63 .cse13)))) (< 0 (+ (let ((.cse14 (store .cse0 .cse12 v_prenex_63))) (select (select .cse14 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1))))))))) is different from false [2024-11-13 14:34:30,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4800)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4799))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4807 (store (select .cse0 .cse4) .cse5 (select v_ArrVal_4807 .cse5)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4800)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4799))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse13 (+ 40 v_prenex_64)) (.cse14 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0)))) (or (< 0 (+ (let ((.cse10 (store .cse14 .cse12 v_prenex_63))) (select (select .cse10 (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= v_prenex_63 (store (select .cse14 .cse12) .cse13 (select v_prenex_63 .cse13)))) (< v_prenex_64 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4800)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4799))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse21 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4807 (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4807 .cse21)))) (< (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4807))) (select (select .cse22 (select (select (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))) is different from false [2024-11-13 14:34:32,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4800)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4799))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse6 .cse7 (store v_ArrVal_4800 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4807 .cse5)) v_ArrVal_4807)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4800)) (.cse19 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4799))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse19 .cse17 (store (select .cse19 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse13 (+ 40 v_prenex_64)) (.cse11 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0))) (.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_prenex_63 (store (select .cse11 .cse12) .cse13 (select v_prenex_63 .cse13)))) (< v_prenex_64 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse14 (store .cse11 .cse12 v_prenex_63))) (select (select .cse14 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse25 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4800)) (.cse28 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4799))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse28 .cse26 (store (select .cse28 .cse26) .cse27 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse20 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 0))) (.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse21 (store .cse20 .cse23 v_ArrVal_4807))) (select (select .cse21 (select (select (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4807 (store (select .cse20 .cse23) .cse24 (select v_ArrVal_4807 .cse24))))))))))))) is different from false [2024-11-13 14:34:44,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse6 .cse7 (store v_ArrVal_4800 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4807 .cse5)) v_ArrVal_4807)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4798))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4797) .cse22 v_ArrVal_4800)) (.cse20 (store .cse21 .cse22 v_ArrVal_4799))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse14 (+ 40 v_prenex_64)) (.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse12 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0)))) (or (not (= (store (select .cse12 .cse13) .cse14 (select v_prenex_63 .cse14)) v_prenex_63)) (< 0 (+ (let ((.cse15 (store .cse12 .cse13 v_prenex_63))) (select (select .cse15 (select (select (store .cse16 .cse13 (store (select .cse16 .cse13) .cse14 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_64 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4798))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4797) .cse33 v_ArrVal_4800)) (.cse31 (store .cse32 .cse33 v_ArrVal_4799))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse31 .cse29 (store (select .cse31 .cse29) .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse23 (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 0))) (.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse24 (store .cse23 .cse26 v_ArrVal_4807))) (select (select .cse24 (select (select (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse23 .cse26) .cse27 (select v_ArrVal_4807 .cse27)) v_ArrVal_4807)))))))))))) is different from false [2024-11-13 14:34:52,693 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse3 (+ 40 v_prenex_64)) (.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_64 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_63 (store (select .cse0 .cse2) .cse3 (select v_prenex_63 .cse3)))) (< 0 (+ (let ((.cse4 (store .cse0 .cse2 v_prenex_63))) (select (select .cse4 (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4798))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4797) .cse23 v_ArrVal_4800)) (.cse21 (store .cse22 .cse23 v_ArrVal_4799))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse16 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse17 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 0)))) (or (< (let ((.cse13 (store .cse17 .cse15 v_ArrVal_4807))) (select (select .cse13 (select (select (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (select .cse17 .cse15) .cse16 (select v_ArrVal_4807 .cse16)) v_ArrVal_4807)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse33 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4798))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4797) .cse34 v_ArrVal_4800)) (.cse32 (store .cse33 .cse34 v_ArrVal_4799))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse31 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse28 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 0))) (.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse24 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 v_ArrVal_4808)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse28 .cse26 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4807 (store (select (store .cse29 .cse30 (store v_ArrVal_4800 .cse31 0)) .cse26) .cse27 (select v_ArrVal_4807 .cse27))))))))))))))) is different from false [2024-11-13 14:35:01,140 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4795))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4796) .cse12 v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_4808)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4807 (store (select (store .cse6 .cse7 (store v_ArrVal_4800 .cse8 0)) .cse4) .cse5 (select v_ArrVal_4807 .cse5)))))))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4795))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse26 .cse25 v_ArrVal_4798))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4796) .cse25 v_ArrVal_4797) .cse24 v_ArrVal_4800)) (.cse22 (store .cse23 .cse24 v_ArrVal_4799))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse22 .cse20 (store (select .cse22 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse14 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse15 (store .cse14 .cse17 v_ArrVal_4807))) (select (select .cse15 (select (select (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4807 (store (select .cse14 .cse17) .cse18 (select v_ArrVal_4807 .cse18)))))))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse39 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4795))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (store .cse39 .cse38 v_ArrVal_4798))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4796) .cse38 v_ArrVal_4797) .cse37 v_ArrVal_4800)) (.cse35 (store .cse36 .cse37 v_ArrVal_4799))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse34 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse35 .cse33 (store (select .cse35 .cse33) .cse34 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse29 (+ 40 v_prenex_64)) (.cse27 (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 0))) (.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_64 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_63 (store (select .cse27 .cse28) .cse29 (select v_prenex_63 .cse29)))) (< 0 (+ (let ((.cse30 (store .cse27 .cse28 v_prenex_63))) (select (select .cse30 (select (select (store .cse31 .cse28 (store (select .cse31 .cse28) .cse29 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))))))) is different from false [2024-11-13 14:35:05,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4795))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4796) .cse13 v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse6 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 0))) (.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse2 .cse3 (store v_ArrVal_4800 .cse4 0)) .cse5) .cse6 (select v_ArrVal_4807 .cse6)) v_ArrVal_4807)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse7 (store .cse8 .cse5 (store (select .cse8 .cse5) .cse6 v_ArrVal_4808)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse5 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4795))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4798))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4796) .cse26 v_ArrVal_4797) .cse25 v_ArrVal_4800)) (.cse23 (store .cse24 .cse25 v_ArrVal_4799))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse19 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40))) (or (< (let ((.cse15 (store .cse19 .cse17 v_ArrVal_4807))) (select (select .cse15 (select (select (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse17) .cse18 (select v_ArrVal_4807 .cse18)) v_ArrVal_4807)))))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse40 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_4795))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse37 (store .cse40 .cse39 v_ArrVal_4798))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_4796) .cse39 v_ArrVal_4797) .cse38 v_ArrVal_4800)) (.cse36 (store .cse37 .cse38 v_ArrVal_4799))) (let ((.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse36 .cse34 (store (select .cse36 .cse34) .cse35 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse30 (+ 40 v_prenex_64)) (.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 0)))) (or (not (= (store (select .cse28 .cse29) .cse30 (select v_prenex_63 .cse30)) v_prenex_63)) (< 0 (+ (let ((.cse31 (store .cse28 .cse29 v_prenex_63))) (select (select .cse31 (select (select (store .cse32 .cse29 (store (select .cse32 .cse29) .cse30 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< v_prenex_64 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-13 14:35:13,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4807 (Array Int Int)) (v_ArrVal_4793 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4794 (Array Int Int)) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4794))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4795))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4798))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4793) .cse12 v_ArrVal_4796) .cse13 v_ArrVal_4797) .cse11 v_ArrVal_4800)) (.cse9 (store .cse10 .cse11 v_ArrVal_4799))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse6 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 0))) (.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4807 (store (select (store .cse2 .cse3 (store v_ArrVal_4800 .cse4 0)) .cse5) .cse6 (select v_ArrVal_4807 .cse6)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_19| (select (let ((.cse7 (store .cse8 .cse5 (store (select .cse8 .cse5) .cse6 v_ArrVal_4808)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse5 v_ArrVal_4807) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (forall ((v_ArrVal_4807 (Array Int Int)) (v_ArrVal_4793 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4794 (Array Int Int)) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_17| Int) (v_ArrVal_4808 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4794))) (let ((.cse27 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse30 .cse27 v_ArrVal_4795))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse29 .cse28 v_ArrVal_4798))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4793) .cse27 v_ArrVal_4796) .cse28 v_ArrVal_4797) .cse26 v_ArrVal_4800)) (.cse24 (store .cse25 .cse26 v_ArrVal_4799))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_17| 40)) (.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse16 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 0)))) (or (not (= v_ArrVal_4807 (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4807 .cse18)))) (< (let ((.cse19 (store .cse16 .cse17 v_ArrVal_4807))) (select (select .cse19 (select (select (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 v_ArrVal_4808)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_17| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_4793 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_19| Int) (v_ArrVal_4794 (Array Int Int)) (v_ArrVal_4795 (Array Int Int)) (v_ArrVal_4796 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_ArrVal_4797 (Array Int Int)) (v_ArrVal_4798 (Array Int Int)) (v_ArrVal_4799 (Array Int Int)) (v_ArrVal_4800 (Array Int Int)) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse45 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4794))) (let ((.cse42 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse44 (store .cse45 .cse42 v_ArrVal_4795))) (let ((.cse43 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse40 (store .cse44 .cse43 v_ArrVal_4798))) (let ((.cse41 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4793) .cse42 v_ArrVal_4796) .cse43 v_ArrVal_4797) .cse41 v_ArrVal_4800)) (.cse39 (store .cse40 .cse41 v_ArrVal_4799))) (let ((.cse37 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse38 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse35 (store .cse39 .cse37 (store (select .cse39 .cse37) .cse38 |v_ULTIMATE.start_main_#t~malloc61#1.base_19|)))) (let ((.cse33 (+ 40 v_prenex_64)) (.cse31 (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 0))) (.cse32 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse31 .cse32) .cse33 (select v_prenex_63 .cse33)) v_prenex_63)) (< v_prenex_64 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse34 (store .cse31 .cse32 v_prenex_63))) (select (select .cse34 (select (select (store .cse35 .cse32 (store (select .cse35 .cse32) .cse33 v_prenex_65)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))))))))) is different from false [2024-11-13 14:35:13,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-13 14:35:13,787 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 14:35:13,788 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 14:35:13,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 14:35:13,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:13,990 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:294) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 66 more [2024-11-13 14:35:13,996 INFO L158 Benchmark]: Toolchain (without parser) took 766252.44ms. Allocated memory was 117.4MB in the beginning and 847.2MB in the end (delta: 729.8MB). Free memory was 89.6MB in the beginning and 744.9MB in the end (delta: -655.4MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-13 14:35:13,996 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:35:13,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1171.60ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 55.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 14:35:13,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.54ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 48.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:35:13,997 INFO L158 Benchmark]: Boogie Preprocessor took 337.98ms. Allocated memory is still 117.4MB. Free memory was 48.3MB in the beginning and 84.9MB in the end (delta: -36.6MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-13 14:35:13,997 INFO L158 Benchmark]: RCFGBuilder took 3846.69ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 84.9MB in the beginning and 82.5MB in the end (delta: 2.4MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2024-11-13 14:35:13,997 INFO L158 Benchmark]: TraceAbstraction took 760723.22ms. Allocated memory was 151.0MB in the beginning and 847.2MB in the end (delta: 696.3MB). Free memory was 81.8MB in the beginning and 744.9MB in the end (delta: -663.2MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-13 14:35:13,999 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1171.60ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 55.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.54ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 48.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 337.98ms. Allocated memory is still 117.4MB. Free memory was 48.3MB in the beginning and 84.9MB in the end (delta: -36.6MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3846.69ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 84.9MB in the beginning and 82.5MB in the end (delta: 2.4MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * TraceAbstraction took 760723.22ms. Allocated memory was 151.0MB in the beginning and 847.2MB in the end (delta: 696.3MB). Free memory was 81.8MB in the beginning and 744.9MB in the end (delta: -663.2MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:35:16,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:35:17,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 14:35:17,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:35:17,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:35:17,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:35:17,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:35:17,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:35:17,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:35:17,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:35:17,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:35:17,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:35:17,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:35:17,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:35:17,080 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:35:17,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:35:17,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:35:17,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:35:17,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:35:17,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:35:17,082 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:35:17,082 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:35:17,082 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:35:17,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:35:17,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:35:17,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:35:17,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:35:17,083 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:35:17,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:35:17,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:35:17,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:35:17,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:35:17,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:35:17,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:35:17,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:35:17,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:35:17,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:35:17,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:35:17,086 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:35:17,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:35:17,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:35:17,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:35:17,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:35:17,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:35:17,087 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_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-13 14:35:17,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:35:17,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:35:17,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:35:17,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:35:17,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:35:17,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i Unable to find full path for "g++" [2024-11-13 14:35:19,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:35:20,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:35:20,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-11-13 14:35:20,431 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data/1d560f9d9/33ef268fe3634221b6f3cc7d8c7b2711/FLAGff6172f18 [2024-11-13 14:35:20,461 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/data/1d560f9d9/33ef268fe3634221b6f3cc7d8c7b2711 [2024-11-13 14:35:20,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:35:20,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:35:20,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:35:20,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:35:20,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:35:20,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:35:20" (1/1) ... [2024-11-13 14:35:20,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2059fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:20, skipping insertion in model container [2024-11-13 14:35:20,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:35:20" (1/1) ... [2024-11-13 14:35:20,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:35:21,181 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,260 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,266 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,273 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,287 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,338 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,339 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 14:35:21,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:35:21,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:35:21,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:35:21,588 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:35:21,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21 WrapperNode [2024-11-13 14:35:21,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:35:21,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:35:21,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:35:21,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:35:21,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,733 INFO L138 Inliner]: procedures = 210, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 862 [2024-11-13 14:35:21,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:35:21,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:35:21,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:35:21,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:35:21,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,829 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-13 14:35:21,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:35:21,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:35:21,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:35:21,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:35:21,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (1/1) ... [2024-11-13 14:35:21,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:35:21,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:21,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:35:21,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:35:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:35:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:35:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:35:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:35:22,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:35:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:35:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-13 14:35:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-13 14:35:22,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-13 14:35:22,018 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-13 14:35:22,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-13 14:35:22,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-13 14:35:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:35:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:35:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:35:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:35:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:35:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:35:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:35:22,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:35:22,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:35:22,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:35:22,354 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:35:22,419 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:35:22,451 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-13 14:35:27,881 INFO L? ?]: Removed 864 outVars from TransFormulas that were not future-live. [2024-11-13 14:35:27,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:35:27,925 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:35:27,926 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-13 14:35:27,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:35:27 BoogieIcfgContainer [2024-11-13 14:35:27,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:35:27,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:35:27,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:35:27,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:35:27,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:35:20" (1/3) ... [2024-11-13 14:35:27,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6408257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:35:27, skipping insertion in model container [2024-11-13 14:35:27,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:21" (2/3) ... [2024-11-13 14:35:27,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6408257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:35:27, skipping insertion in model container [2024-11-13 14:35:27,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:35:27" (3/3) ... [2024-11-13 14:35:27,938 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2024-11-13 14:35:27,957 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:35:27,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 869 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-11-13 14:35:28,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:35:28,059 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;@5d9f1701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:35:28,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-13 14:35:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 859 states, 437 states have (on average 2.196796338672769) internal successors, (960), 854 states have internal predecessors, (960), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:35:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:35:28,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:28,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:35:28,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1758107, now seen corresponding path program 1 times [2024-11-13 14:35:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037840533] [2024-11-13 14:35:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:28,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:28,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:28,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:35:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:28,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:35:28,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:28,509 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-13 14:35:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:28,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:28,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:28,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037840533] [2024-11-13 14:35:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037840533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:28,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:28,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296877227] [2024-11-13 14:35:28,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-13 14:35:28,569 INFO L87 Difference]: Start difference. First operand has 859 states, 437 states have (on average 2.196796338672769) internal successors, (960), 854 states have internal predecessors, (960), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:31,345 INFO L93 Difference]: Finished difference Result 1062 states and 1142 transitions. [2024-11-13 14:35:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:35:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 14:35:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:31,374 INFO L225 Difference]: With dead ends: 1062 [2024-11-13 14:35:31,374 INFO L226 Difference]: Without dead ends: 1059 [2024-11-13 14:35:31,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-13 14:35:31,380 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 233 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1143 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:31,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1249 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 1143 Unchecked, 2.6s Time] [2024-11-13 14:35:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-13 14:35:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 847. [2024-11-13 14:35:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 431 states have (on average 2.0580046403712298) internal successors, (887), 842 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:35:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 893 transitions. [2024-11-13 14:35:31,497 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 893 transitions. Word has length 4 [2024-11-13 14:35:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:31,498 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 893 transitions. [2024-11-13 14:35:31,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 893 transitions. [2024-11-13 14:35:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:35:31,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:31,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:35:31,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:35:31,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:31,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:31,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-13 14:35:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236897222] [2024-11-13 14:35:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:31,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:31,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:35:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:31,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:35:31,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:31,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 14:35:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:31,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:31,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236897222] [2024-11-13 14:35:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236897222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:31,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:31,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:35:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330563827] [2024-11-13 14:35:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:31,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:35:31,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:31,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:35:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:31,902 INFO L87 Difference]: Start difference. First operand 847 states and 893 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:33,900 INFO L93 Difference]: Finished difference Result 844 states and 891 transitions. [2024-11-13 14:35:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:35:33,902 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-13 14:35:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:33,907 INFO L225 Difference]: With dead ends: 844 [2024-11-13 14:35:33,908 INFO L226 Difference]: Without dead ends: 844 [2024-11-13 14:35:33,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:33,910 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 775 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:33,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 550 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:35:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-13 14:35:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2024-11-13 14:35:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 439 states have (on average 2.0159453302961277) internal successors, (885), 839 states have internal predecessors, (885), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:35:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 891 transitions. [2024-11-13 14:35:33,950 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 891 transitions. Word has length 4 [2024-11-13 14:35:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:33,951 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 891 transitions. [2024-11-13 14:35:33,951 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-13 14:35:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 891 transitions. [2024-11-13 14:35:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 14:35:33,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:33,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 14:35:33,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:35:34,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:34,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:34,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-13 14:35:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:34,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346694851] [2024-11-13 14:35:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:34,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:34,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:34,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:35:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:34,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:35:34,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:34,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:35:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:34,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:34,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346694851] [2024-11-13 14:35:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346694851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:35:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529301076] [2024-11-13 14:35:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:34,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:35:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:35:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:34,375 INFO L87 Difference]: Start difference. First operand 844 states and 891 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:37,248 INFO L93 Difference]: Finished difference Result 1055 states and 1123 transitions. [2024-11-13 14:35:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:35:37,249 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-13 14:35:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:37,254 INFO L225 Difference]: With dead ends: 1055 [2024-11-13 14:35:37,254 INFO L226 Difference]: Without dead ends: 1055 [2024-11-13 14:35:37,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:37,256 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 232 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:37,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1251 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 14:35:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-11-13 14:35:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 969. [2024-11-13 14:35:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 565 states have (on average 1.9716814159292035) internal successors, (1114), 964 states have internal predecessors, (1114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 14:35:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1120 transitions. [2024-11-13 14:35:37,288 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1120 transitions. Word has length 4 [2024-11-13 14:35:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:37,289 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1120 transitions. [2024-11-13 14:35:37,289 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-13 14:35:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1120 transitions. [2024-11-13 14:35:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 14:35:37,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:37,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:37,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:35:37,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:37,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:37,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-13 14:35:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357684469] [2024-11-13 14:35:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:37,495 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:37,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:35:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:37,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:35:37,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:37,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:35:37,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 14:35:37,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:35:37,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2024-11-13 14:35:37,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:35:37,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:35:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:37,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:37,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357684469] [2024-11-13 14:35:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357684469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884371834] [2024-11-13 14:35:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:37,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:37,935 INFO L87 Difference]: Start difference. First operand 969 states and 1120 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:45,862 INFO L93 Difference]: Finished difference Result 2016 states and 2236 transitions. [2024-11-13 14:35:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:35:45,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 14:35:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:45,872 INFO L225 Difference]: With dead ends: 2016 [2024-11-13 14:35:45,872 INFO L226 Difference]: Without dead ends: 2016 [2024-11-13 14:35:45,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:35:45,873 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1398 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:45,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1401 Valid, 1030 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-13 14:35:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-11-13 14:35:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1155. [2024-11-13 14:35:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 751 states have (on average 1.9733688415446071) internal successors, (1482), 1148 states have internal predecessors, (1482), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1492 transitions. [2024-11-13 14:35:45,916 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1492 transitions. Word has length 8 [2024-11-13 14:35:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:45,917 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1492 transitions. [2024-11-13 14:35:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1492 transitions. [2024-11-13 14:35:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:35:45,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:45,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:45,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:35:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:46,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-13 14:35:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:46,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873293464] [2024-11-13 14:35:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:46,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:46,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:35:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:46,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:35:46,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:46,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 14:35:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:46,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:46,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:46,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873293464] [2024-11-13 14:35:46,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873293464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:46,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:46,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:35:46,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402108730] [2024-11-13 14:35:46,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:46,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:35:46,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:46,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:35:46,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:46,280 INFO L87 Difference]: Start difference. First operand 1155 states and 1492 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:48,308 INFO L93 Difference]: Finished difference Result 1320 states and 1654 transitions. [2024-11-13 14:35:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:35:48,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 14:35:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:48,314 INFO L225 Difference]: With dead ends: 1320 [2024-11-13 14:35:48,315 INFO L226 Difference]: Without dead ends: 1320 [2024-11-13 14:35:48,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:48,316 INFO L432 NwaCegarLoop]: 664 mSDtfsCounter, 760 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:48,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 812 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 14:35:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-13 14:35:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1108. [2024-11-13 14:35:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 751 states have (on average 1.8788282290279628) internal successors, (1411), 1101 states have internal predecessors, (1411), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1421 transitions. [2024-11-13 14:35:48,348 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1421 transitions. Word has length 9 [2024-11-13 14:35:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:48,348 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1421 transitions. [2024-11-13 14:35:48,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1421 transitions. [2024-11-13 14:35:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:35:48,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:48,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:48,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:35:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:48,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-13 14:35:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406284811] [2024-11-13 14:35:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:48,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:48,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:48,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:35:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:48,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:35:48,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:48,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:35:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:48,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:48,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:48,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406284811] [2024-11-13 14:35:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406284811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:35:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169208135] [2024-11-13 14:35:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:48,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:35:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:35:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:48,761 INFO L87 Difference]: Start difference. First operand 1108 states and 1421 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:51,618 INFO L93 Difference]: Finished difference Result 1578 states and 2045 transitions. [2024-11-13 14:35:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:35:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 14:35:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:51,624 INFO L225 Difference]: With dead ends: 1578 [2024-11-13 14:35:51,624 INFO L226 Difference]: Without dead ends: 1578 [2024-11-13 14:35:51,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:51,626 INFO L432 NwaCegarLoop]: 841 mSDtfsCounter, 513 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:51,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1156 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 14:35:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-13 14:35:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1170. [2024-11-13 14:35:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 823 states have (on average 1.8675577156743621) internal successors, (1537), 1163 states have internal predecessors, (1537), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1547 transitions. [2024-11-13 14:35:51,664 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1547 transitions. Word has length 9 [2024-11-13 14:35:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:51,664 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1547 transitions. [2024-11-13 14:35:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1547 transitions. [2024-11-13 14:35:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:35:51,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:51,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:51,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:35:51,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:51,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:51,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1230536609, now seen corresponding path program 1 times [2024-11-13 14:35:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83803321] [2024-11-13 14:35:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:51,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:51,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:51,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:51,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:35:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:52,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:35:52,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:52,167 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-13 14:35:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:52,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:52,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83803321] [2024-11-13 14:35:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83803321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:52,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104680559] [2024-11-13 14:35:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-13 14:35:52,170 INFO L87 Difference]: Start difference. First operand 1170 states and 1547 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:54,061 INFO L93 Difference]: Finished difference Result 1383 states and 1780 transitions. [2024-11-13 14:35:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:35:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 14:35:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:54,070 INFO L225 Difference]: With dead ends: 1383 [2024-11-13 14:35:54,070 INFO L226 Difference]: Without dead ends: 1381 [2024-11-13 14:35:54,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-13 14:35:54,072 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 226 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1056 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:54,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1181 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 464 Invalid, 0 Unknown, 1056 Unchecked, 1.9s Time] [2024-11-13 14:35:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-13 14:35:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1296. [2024-11-13 14:35:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 949 states have (on average 1.8609062170706006) internal successors, (1766), 1289 states have internal predecessors, (1766), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1776 transitions. [2024-11-13 14:35:54,109 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1776 transitions. Word has length 11 [2024-11-13 14:35:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:54,110 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1776 transitions. [2024-11-13 14:35:54,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1776 transitions. [2024-11-13 14:35:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 14:35:54,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:54,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:54,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:35:54,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:54,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1030029400, now seen corresponding path program 1 times [2024-11-13 14:35:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418757755] [2024-11-13 14:35:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:54,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:54,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:35:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:54,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:35:54,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:54,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-13 14:35:54,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:54,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418757755] [2024-11-13 14:35:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418757755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:54,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299959250] [2024-11-13 14:35:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:54,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:54,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:54,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:54,541 INFO L87 Difference]: Start difference. First operand 1296 states and 1776 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:57,172 INFO L93 Difference]: Finished difference Result 1285 states and 1719 transitions. [2024-11-13 14:35:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:35:57,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 14:35:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:57,176 INFO L225 Difference]: With dead ends: 1285 [2024-11-13 14:35:57,177 INFO L226 Difference]: Without dead ends: 1285 [2024-11-13 14:35:57,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:35:57,178 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 774 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:57,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 880 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 14:35:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2024-11-13 14:35:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1273. [2024-11-13 14:35:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 949 states have (on average 1.7881981032665963) internal successors, (1697), 1266 states have internal predecessors, (1697), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1707 transitions. [2024-11-13 14:35:57,206 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1707 transitions. Word has length 14 [2024-11-13 14:35:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:57,206 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1707 transitions. [2024-11-13 14:35:57,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1707 transitions. [2024-11-13 14:35:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 14:35:57,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:57,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:57,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 14:35:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:57,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:57,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1030029401, now seen corresponding path program 1 times [2024-11-13 14:35:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100326982] [2024-11-13 14:35:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:57,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:57,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:57,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:57,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:35:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:57,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:35:57,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:57,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:57,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100326982] [2024-11-13 14:35:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100326982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031368554] [2024-11-13 14:35:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:35:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:35:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:57,574 INFO L87 Difference]: Start difference. First operand 1273 states and 1707 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:57,611 INFO L93 Difference]: Finished difference Result 1207 states and 1614 transitions. [2024-11-13 14:35:57,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:35:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 14:35:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:57,616 INFO L225 Difference]: With dead ends: 1207 [2024-11-13 14:35:57,616 INFO L226 Difference]: Without dead ends: 1207 [2024-11-13 14:35:57,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:57,617 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 61 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:57,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1463 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:35:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2024-11-13 14:35:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1207. [2024-11-13 14:35:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 895 states have (on average 1.7921787709497208) internal successors, (1604), 1200 states have internal predecessors, (1604), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1614 transitions. [2024-11-13 14:35:57,646 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1614 transitions. Word has length 14 [2024-11-13 14:35:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:57,647 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1614 transitions. [2024-11-13 14:35:57,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1614 transitions. [2024-11-13 14:35:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 14:35:57,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:57,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:57,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:35:57,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:57,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:57,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2015799346, now seen corresponding path program 1 times [2024-11-13 14:35:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:57,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492111479] [2024-11-13 14:35:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:57,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:57,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:57,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:57,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:35:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:58,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:35:58,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:58,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:58,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492111479] [2024-11-13 14:35:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492111479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:35:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068387477] [2024-11-13 14:35:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:58,061 INFO L87 Difference]: Start difference. First operand 1207 states and 1614 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:35:58,176 INFO L93 Difference]: Finished difference Result 1176 states and 1548 transitions. [2024-11-13 14:35:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:58,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 14:35:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:35:58,181 INFO L225 Difference]: With dead ends: 1176 [2024-11-13 14:35:58,181 INFO L226 Difference]: Without dead ends: 1176 [2024-11-13 14:35:58,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:35:58,182 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 45 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:35:58,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2137 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:35:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-13 14:35:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2024-11-13 14:35:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 871 states have (on average 1.7657864523536166) internal successors, (1538), 1169 states have internal predecessors, (1538), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:35:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1548 transitions. [2024-11-13 14:35:58,209 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1548 transitions. Word has length 16 [2024-11-13 14:35:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:35:58,210 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1548 transitions. [2024-11-13 14:35:58,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1548 transitions. [2024-11-13 14:35:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:35:58,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:35:58,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:58,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:35:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:58,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:35:58,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash -179577158, now seen corresponding path program 1 times [2024-11-13 14:35:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:35:58,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317990828] [2024-11-13 14:35:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:58,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:58,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:58,414 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:58,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:35:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:58,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:35:58,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:35:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:58,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:35:58,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317990828] [2024-11-13 14:35:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317990828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:58,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:58,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391750995] [2024-11-13 14:35:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:58,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:58,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:58,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:58,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:58,674 INFO L87 Difference]: Start difference. First operand 1176 states and 1548 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:36:01,070 INFO L93 Difference]: Finished difference Result 1204 states and 1512 transitions. [2024-11-13 14:36:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:36:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-13 14:36:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:36:01,075 INFO L225 Difference]: With dead ends: 1204 [2024-11-13 14:36:01,076 INFO L226 Difference]: Without dead ends: 1204 [2024-11-13 14:36:01,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:36:01,077 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 727 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:36:01,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1028 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 14:36:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-11-13 14:36:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1153. [2024-11-13 14:36:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 871 states have (on average 1.7129735935706085) internal successors, (1492), 1146 states have internal predecessors, (1492), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:36:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1502 transitions. [2024-11-13 14:36:01,108 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1502 transitions. Word has length 19 [2024-11-13 14:36:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:36:01,108 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1502 transitions. [2024-11-13 14:36:01,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1502 transitions. [2024-11-13 14:36:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:36:01,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:36:01,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:36:01,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:36:01,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:01,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:36:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:36:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -179577157, now seen corresponding path program 1 times [2024-11-13 14:36:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:36:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048990116] [2024-11-13 14:36:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:36:01,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:36:01,313 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:36:01,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:36:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:36:01,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:36:01,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:36:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:36:01,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:36:01,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:36:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048990116] [2024-11-13 14:36:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048990116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:36:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:36:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:36:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041917099] [2024-11-13 14:36:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:36:01,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:36:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:36:01,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:36:01,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:36:01,505 INFO L87 Difference]: Start difference. First operand 1153 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:36:01,550 INFO L93 Difference]: Finished difference Result 1105 states and 1440 transitions. [2024-11-13 14:36:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:36:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-13 14:36:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:36:01,556 INFO L225 Difference]: With dead ends: 1105 [2024-11-13 14:36:01,556 INFO L226 Difference]: Without dead ends: 1105 [2024-11-13 14:36:01,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:36:01,557 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 61 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:36:01,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1299 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:36:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-13 14:36:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2024-11-13 14:36:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 835 states have (on average 1.7125748502994012) internal successors, (1430), 1098 states have internal predecessors, (1430), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:36:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1440 transitions. [2024-11-13 14:36:01,582 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1440 transitions. Word has length 19 [2024-11-13 14:36:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:36:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1440 transitions. [2024-11-13 14:36:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1440 transitions. [2024-11-13 14:36:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 14:36:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:36:01,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:36:01,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:36:01,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:01,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:36:01,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:36:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -774960908, now seen corresponding path program 1 times [2024-11-13 14:36:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:36:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574183806] [2024-11-13 14:36:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:36:01,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:01,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:36:01,790 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:36:01,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:36:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:36:01,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:36:01,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:36:01,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-13 14:36:01,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:36:01,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:36:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574183806] [2024-11-13 14:36:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574183806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:36:01,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:36:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:36:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891429136] [2024-11-13 14:36:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:36:01,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:36:01,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:36:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:36:01,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:36:01,998 INFO L87 Difference]: Start difference. First operand 1105 states and 1440 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:36:02,119 INFO L93 Difference]: Finished difference Result 1082 states and 1396 transitions. [2024-11-13 14:36:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:36:02,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 14:36:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:36:02,124 INFO L225 Difference]: With dead ends: 1082 [2024-11-13 14:36:02,125 INFO L226 Difference]: Without dead ends: 1082 [2024-11-13 14:36:02,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:36:02,126 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 45 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:36:02,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1891 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:36:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-11-13 14:36:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2024-11-13 14:36:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 819 states have (on average 1.6923076923076923) internal successors, (1386), 1075 states have internal predecessors, (1386), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:36:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1396 transitions. [2024-11-13 14:36:02,159 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1396 transitions. Word has length 21 [2024-11-13 14:36:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:36:02,159 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1396 transitions. [2024-11-13 14:36:02,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1396 transitions. [2024-11-13 14:36:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 14:36:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:36:02,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:36:02,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:36:02,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:02,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:36:02,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:36:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1100440288, now seen corresponding path program 1 times [2024-11-13 14:36:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:36:02,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045153370] [2024-11-13 14:36:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:36:02,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:02,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:36:02,366 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:36:02,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:36:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:36:02,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:36:02,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:36:02,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:36:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:36:02,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:36:02,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:36:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045153370] [2024-11-13 14:36:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045153370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:36:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:36:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:36:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282434809] [2024-11-13 14:36:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:36:02,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:36:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:36:02,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:36:02,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:36:02,897 INFO L87 Difference]: Start difference. First operand 1082 states and 1396 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:36:05,587 INFO L93 Difference]: Finished difference Result 1125 states and 1398 transitions. [2024-11-13 14:36:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:36:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-13 14:36:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:36:05,591 INFO L225 Difference]: With dead ends: 1125 [2024-11-13 14:36:05,591 INFO L226 Difference]: Without dead ends: 1125 [2024-11-13 14:36:05,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:36:05,591 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 160 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:36:05,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1268 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 14:36:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-13 14:36:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1082. [2024-11-13 14:36:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 819 states have (on average 1.6874236874236874) internal successors, (1382), 1075 states have internal predecessors, (1382), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 14:36:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1392 transitions. [2024-11-13 14:36:05,611 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1392 transitions. Word has length 30 [2024-11-13 14:36:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:36:05,611 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1392 transitions. [2024-11-13 14:36:05,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1392 transitions. [2024-11-13 14:36:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:36:05,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:36:05,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:36:05,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:36:05,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:05,814 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-13 14:36:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:36:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2010845566, now seen corresponding path program 1 times [2024-11-13 14:36:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:36:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313367327] [2024-11-13 14:36:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:36:05,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:36:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:36:05,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:36:05,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2f5c225-adcf-4a17-a3db-761504d15bc5/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:36:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:36:06,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:36:06,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:36:06,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 14:36:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:36:06,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:36:06,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:36:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313367327] [2024-11-13 14:36:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313367327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:36:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:36:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:36:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384978000] [2024-11-13 14:36:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:36:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:36:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:36:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:36:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:36:06,314 INFO L87 Difference]: Start difference. First operand 1082 states and 1392 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)