./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-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_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/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_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/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_8b326199-deb7-4a3c-91da-4768c1039696/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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:33:14,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:33:15,039 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 16:33:15,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:33:15,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:33:15,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:33:15,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:33:15,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:33:15,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:33:15,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:33:15,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:33:15,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:33:15,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:33:15,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:33:15,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:33:15,080 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:33:15,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:33:15,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:33:15,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:33:15,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:33:15,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:33:15,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:33:15,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:33:15,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:33:15,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:33:15,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:33:15,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:33:15,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:33:15,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:33:15,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:33:15,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:33:15,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:33:15,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:33:15,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:33:15,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:33:15,085 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_8b326199-deb7-4a3c-91da-4768c1039696/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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2024-11-13 16:33:15,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:33:15,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:33:15,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:33:15,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:33:15,453 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:33:15,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i Unable to find full path for "g++" [2024-11-13 16:33:17,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:33:17,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:33:17,909 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-13 16:33:17,930 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/data/1aaeb26ca/3c74d51de27b4b9db4a6f7e28a596016/FLAG689ca53c6 [2024-11-13 16:33:17,950 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/data/1aaeb26ca/3c74d51de27b4b9db4a6f7e28a596016 [2024-11-13 16:33:17,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:33:17,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:33:17,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:33:17,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:33:17,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:33:17,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:33:17" (1/1) ... [2024-11-13 16:33:17,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58064a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:17, skipping insertion in model container [2024-11-13 16:33:17,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:33:17" (1/1) ... [2024-11-13 16:33:18,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:33:18,336 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 16:33:18,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:33:18,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:33:18,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:33:18,518 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:33:18,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18 WrapperNode [2024-11-13 16:33:18,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:33:18,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:33:18,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:33:18,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:33:18,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,581 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-13 16:33:18,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:33:18,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:33:18,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:33:18,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:33:18,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,636 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2024-11-13 16:33:18,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:33:18,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:33:18,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:33:18,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:33:18,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (1/1) ... [2024-11-13 16:33:18,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:33:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:18,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:33:18,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:33:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:33:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:33:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:33:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:33:18,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:33:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-13 16:33:18,734 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 16:33:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:33:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:33:18,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:33:18,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:33:18,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:33:19,631 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-13 16:33:19,631 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:33:19,659 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:33:19,660 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 16:33:19,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:33:19 BoogieIcfgContainer [2024-11-13 16:33:19,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:33:19,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:33:19,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:33:19,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:33:19,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:33:17" (1/3) ... [2024-11-13 16:33:19,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbd9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:33:19, skipping insertion in model container [2024-11-13 16:33:19,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:33:18" (2/3) ... [2024-11-13 16:33:19,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbd9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:33:19, skipping insertion in model container [2024-11-13 16:33:19,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:33:19" (3/3) ... [2024-11-13 16:33:19,674 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-13 16:33:19,698 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:33:19,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 193 locations, 1 initial locations, 4 loop locations, and 92 error locations. [2024-11-13 16:33:19,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:33:19,766 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;@7f1eb3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:33:19,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-13 16:33:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 97 states have (on average 2.11340206185567) internal successors, (205), 189 states have internal predecessors, (205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 16:33:19,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:19,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 16:33:19,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 4868360, now seen corresponding path program 1 times [2024-11-13 16:33:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:19,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164909612] [2024-11-13 16:33:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:19,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164909612] [2024-11-13 16:33:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164909612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:19,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:33:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671250928] [2024-11-13 16:33:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:19,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:33:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:33:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:33:19,966 INFO L87 Difference]: Start difference. First operand has 193 states, 97 states have (on average 2.11340206185567) internal successors, (205), 189 states have internal predecessors, (205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 16:33:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:19,993 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-13 16:33:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:33:19,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 16:33:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:20,005 INFO L225 Difference]: With dead ends: 193 [2024-11-13 16:33:20,005 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 16:33:20,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:33:20,012 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:20,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:33:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 16:33:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-13 16:33:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 96 states have (on average 2.0729166666666665) internal successors, (199), 187 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2024-11-13 16:33:20,082 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 4 [2024-11-13 16:33:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:20,082 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2024-11-13 16:33:20,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 16:33:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2024-11-13 16:33:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 16:33:20,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:20,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 16:33:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:33:20,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 4865989, now seen corresponding path program 1 times [2024-11-13 16:33:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499284562] [2024-11-13 16:33:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499284562] [2024-11-13 16:33:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499284562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:20,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:33:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425945224] [2024-11-13 16:33:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:20,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:33:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:33:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:33:20,305 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. 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 16:33:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:20,613 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-11-13 16:33:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:33:20,614 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 16:33:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:20,615 INFO L225 Difference]: With dead ends: 185 [2024-11-13 16:33:20,615 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 16:33:20,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:33:20,617 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:20,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 312 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:33:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 16:33:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-13 16:33:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0104166666666665) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2024-11-13 16:33:20,627 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2024-11-13 16:33:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2024-11-13 16:33:20,627 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 16:33:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2024-11-13 16:33:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 16:33:20,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:20,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 16:33:20,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:33:20,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:20,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash 4865990, now seen corresponding path program 1 times [2024-11-13 16:33:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:20,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86615048] [2024-11-13 16:33:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:20,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:20,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86615048] [2024-11-13 16:33:20,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86615048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:20,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:20,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:33:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645829638] [2024-11-13 16:33:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:20,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:33:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:20,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:33:20,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:33:20,935 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. 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 16:33:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:21,322 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-11-13 16:33:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:33:21,324 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 16:33:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:21,327 INFO L225 Difference]: With dead ends: 201 [2024-11-13 16:33:21,327 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 16:33:21,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 16:33:21,330 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:21,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 352 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:33:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 16:33:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-13 16:33:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 186 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-11-13 16:33:21,343 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2024-11-13 16:33:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:21,343 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-11-13 16:33:21,343 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 16:33:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-11-13 16:33:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:33:21,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:21,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:33:21,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:33:21,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:21,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash 150845767, now seen corresponding path program 1 times [2024-11-13 16:33:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:21,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103383125] [2024-11-13 16:33:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103383125] [2024-11-13 16:33:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103383125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:21,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:33:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708170130] [2024-11-13 16:33:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:21,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:33:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:33:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:21,389 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:21,560 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2024-11-13 16:33:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:33:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 16:33:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:21,562 INFO L225 Difference]: With dead ends: 188 [2024-11-13 16:33:21,562 INFO L226 Difference]: Without dead ends: 188 [2024-11-13 16:33:21,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:21,564 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:21,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:33:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-13 16:33:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-13 16:33:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.9504950495049505) internal successors, (197), 184 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-11-13 16:33:21,586 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2024-11-13 16:33:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:21,586 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-11-13 16:33:21,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-11-13 16:33:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:33:21,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:21,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:33:21,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:33:21,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:21,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 150845768, now seen corresponding path program 1 times [2024-11-13 16:33:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:21,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381319789] [2024-11-13 16:33:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381319789] [2024-11-13 16:33:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381319789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:21,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:33:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110771211] [2024-11-13 16:33:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:21,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:33:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:33:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:21,707 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:21,890 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-11-13 16:33:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:33:21,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 16:33:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:21,892 INFO L225 Difference]: With dead ends: 186 [2024-11-13 16:33:21,892 INFO L226 Difference]: Without dead ends: 186 [2024-11-13 16:33:21,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:21,894 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:21,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:33:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-13 16:33:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-13 16:33:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.9207920792079207) internal successors, (194), 182 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2024-11-13 16:33:21,909 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2024-11-13 16:33:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:21,909 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2024-11-13 16:33:21,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2024-11-13 16:33:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 16:33:21,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:21,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:33:21,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1025963704, now seen corresponding path program 1 times [2024-11-13 16:33:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406287510] [2024-11-13 16:33:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406287510] [2024-11-13 16:33:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406287510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:33:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723795810] [2024-11-13 16:33:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:22,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:33:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:22,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:33:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:33:22,150 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:22,298 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-13 16:33:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:33:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 16:33:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:22,300 INFO L225 Difference]: With dead ends: 195 [2024-11-13 16:33:22,300 INFO L226 Difference]: Without dead ends: 195 [2024-11-13 16:33:22,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:33:22,301 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:22,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 714 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:33:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-13 16:33:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-11-13 16:33:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.911764705882353) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-13 16:33:22,309 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2024-11-13 16:33:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:22,309 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-13 16:33:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-13 16:33:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:33:22,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:22,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:22,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:33:22,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1894491298, now seen corresponding path program 1 times [2024-11-13 16:33:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:22,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013726972] [2024-11-13 16:33:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013726972] [2024-11-13 16:33:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013726972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:33:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89988668] [2024-11-13 16:33:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:22,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:33:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:33:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:33:22,423 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:22,465 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2024-11-13 16:33:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:33:22,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 16:33:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:22,467 INFO L225 Difference]: With dead ends: 266 [2024-11-13 16:33:22,467 INFO L226 Difference]: Without dead ends: 266 [2024-11-13 16:33:22,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:33:22,468 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 83 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:22,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:33:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-13 16:33:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2024-11-13 16:33:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 225 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2024-11-13 16:33:22,485 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2024-11-13 16:33:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2024-11-13 16:33:22,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2024-11-13 16:33:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:33:22,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:22,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:33:22,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:22,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1400318095, now seen corresponding path program 1 times [2024-11-13 16:33:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747738120] [2024-11-13 16:33:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:22,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:22,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747738120] [2024-11-13 16:33:22,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747738120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:22,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:33:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690830968] [2024-11-13 16:33:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:22,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:33:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:33:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:22,596 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:22,775 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2024-11-13 16:33:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:33:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 16:33:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:22,776 INFO L225 Difference]: With dead ends: 215 [2024-11-13 16:33:22,778 INFO L226 Difference]: Without dead ends: 215 [2024-11-13 16:33:22,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:22,779 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:22,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:33:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-13 16:33:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-13 16:33:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 210 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-11-13 16:33:22,787 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2024-11-13 16:33:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-11-13 16:33:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-11-13 16:33:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:33:22,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:22,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:33:22,789 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:22,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1400318096, now seen corresponding path program 1 times [2024-11-13 16:33:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276296886] [2024-11-13 16:33:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276296886] [2024-11-13 16:33:22,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276296886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:22,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:22,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:33:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012263904] [2024-11-13 16:33:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:33:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:33:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:22,949 INFO L87 Difference]: Start difference. First operand 215 states and 252 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:23,102 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-11-13 16:33:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:33:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 16:33:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:23,105 INFO L225 Difference]: With dead ends: 200 [2024-11-13 16:33:23,105 INFO L226 Difference]: Without dead ends: 200 [2024-11-13 16:33:23,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:33:23,106 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:23,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 207 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:33:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-13 16:33:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-13 16:33:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 195 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-11-13 16:33:23,114 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2024-11-13 16:33:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-11-13 16:33:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-11-13 16:33:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 16:33:23,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:23,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:23,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:33:23,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1951801611, now seen corresponding path program 1 times [2024-11-13 16:33:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612440834] [2024-11-13 16:33:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612440834] [2024-11-13 16:33:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612440834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:23,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:33:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090138049] [2024-11-13 16:33:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:33:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:33:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:33:23,337 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:23,612 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2024-11-13 16:33:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:33:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-13 16:33:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:23,617 INFO L225 Difference]: With dead ends: 253 [2024-11-13 16:33:23,617 INFO L226 Difference]: Without dead ends: 253 [2024-11-13 16:33:23,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:33:23,618 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:23,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 413 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:33:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-13 16:33:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2024-11-13 16:33:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.513157894736842) internal successors, (230), 203 states have internal predecessors, (230), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2024-11-13 16:33:23,628 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2024-11-13 16:33:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:23,628 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2024-11-13 16:33:23,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2024-11-13 16:33:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 16:33:23,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:23,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:23,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:33:23,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:23,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1951801612, now seen corresponding path program 1 times [2024-11-13 16:33:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779608033] [2024-11-13 16:33:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779608033] [2024-11-13 16:33:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779608033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:33:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:33:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:33:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038713745] [2024-11-13 16:33:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:33:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:33:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:33:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:33:23,990 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:24,333 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-11-13 16:33:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:33:24,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-13 16:33:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:24,335 INFO L225 Difference]: With dead ends: 208 [2024-11-13 16:33:24,335 INFO L226 Difference]: Without dead ends: 208 [2024-11-13 16:33:24,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:33:24,336 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:24,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:33:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-13 16:33:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-13 16:33:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.486842105263158) internal successors, (226), 203 states have internal predecessors, (226), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-11-13 16:33:24,343 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2024-11-13 16:33:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:24,344 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-11-13 16:33:24,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-11-13 16:33:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 16:33:24,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:24,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:24,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:33:24,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 881626655, now seen corresponding path program 1 times [2024-11-13 16:33:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388437516] [2024-11-13 16:33:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:24,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:24,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388437516] [2024-11-13 16:33:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388437516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975877607] [2024-11-13 16:33:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:24,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:24,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:24,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:33:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:24,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 16:33:24,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:24,920 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 16:33:24,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 16:33:24,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:33:25,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:33:25,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 16:33:25,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:33:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:33:25,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:25,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_162) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4))) 1)) is different from false [2024-11-13 16:33:25,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:25,333 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 16:33:25,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-13 16:33:25,350 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 9 treesize of output 5 [2024-11-13 16:33:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 16:33:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975877607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:33:25,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:33:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-13 16:33:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149628898] [2024-11-13 16:33:25,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:33:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:33:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:33:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=4, NotChecked=22, Total=182 [2024-11-13 16:33:25,391 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:25,945 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-11-13 16:33:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:33:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-13 16:33:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:25,947 INFO L225 Difference]: With dead ends: 209 [2024-11-13 16:33:25,947 INFO L226 Difference]: Without dead ends: 209 [2024-11-13 16:33:25,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=4, NotChecked=22, Total=182 [2024-11-13 16:33:25,948 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 44 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:25,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 788 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 500 Invalid, 0 Unknown, 93 Unchecked, 0.5s Time] [2024-11-13 16:33:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-13 16:33:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-13 16:33:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 202 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-11-13 16:33:25,955 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2024-11-13 16:33:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:25,955 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-11-13 16:33:25,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-11-13 16:33:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 16:33:25,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:25,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:25,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 16:33:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:26,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 881626656, now seen corresponding path program 1 times [2024-11-13 16:33:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694089776] [2024-11-13 16:33:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694089776] [2024-11-13 16:33:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694089776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437808037] [2024-11-13 16:33:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:26,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:26,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:26,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:33:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:26,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 16:33:26,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 16:33:26,886 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 13 treesize of output 1 [2024-11-13 16:33:26,890 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 10 treesize of output 8 [2024-11-13 16:33:26,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 16:33:26,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:33:27,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:33:27,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:33:27,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:33:27,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:33:27,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 16:33:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:27,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:27,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-13 16:33:27,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-13 16:33:27,343 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1) 4)))))) is different from false [2024-11-13 16:33:27,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:27,356 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 16:33:27,362 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 40 treesize of output 28 [2024-11-13 16:33:27,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:27,380 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-13 16:33:27,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:27,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-13 16:33:27,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:33:27,397 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 33 treesize of output 21 [2024-11-13 16:33:27,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:33:27,404 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 24 treesize of output 12 [2024-11-13 16:33:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-13 16:33:27,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437808037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:33:27,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:33:27,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2024-11-13 16:33:27,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005897626] [2024-11-13 16:33:27,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:33:27,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 16:33:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:27,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 16:33:27,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=189, Unknown=3, NotChecked=90, Total=342 [2024-11-13 16:33:27,442 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:28,054 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2024-11-13 16:33:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:33:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-13 16:33:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:28,057 INFO L225 Difference]: With dead ends: 217 [2024-11-13 16:33:28,058 INFO L226 Difference]: Without dead ends: 217 [2024-11-13 16:33:28,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2024-11-13 16:33:28,058 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:28,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 956 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 244 Unchecked, 0.5s Time] [2024-11-13 16:33:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-13 16:33:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-13 16:33:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 212 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2024-11-13 16:33:28,071 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 23 [2024-11-13 16:33:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:28,071 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2024-11-13 16:33:28,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2024-11-13 16:33:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 16:33:28,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:28,072 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:28,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:33:28,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 16:33:28,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:28,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1215507852, now seen corresponding path program 2 times [2024-11-13 16:33:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:28,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669799865] [2024-11-13 16:33:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669799865] [2024-11-13 16:33:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669799865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515603178] [2024-11-13 16:33:28,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:33:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:28,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:28,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:28,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:33:29,092 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:33:29,092 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:33:29,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 16:33:29,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:29,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 16:33:29,124 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 13 treesize of output 1 [2024-11-13 16:33:29,128 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 10 treesize of output 8 [2024-11-13 16:33:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:33:29,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 16:33:29,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:33:29,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 16:33:29,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:33:29,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 16:33:29,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 16:33:29,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-13 16:33:29,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 16:33:29,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 16:33:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:29,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:29,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_294) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-13 16:33:29,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_294) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-13 16:33:29,964 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_291))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_292) .cse1 v_ArrVal_293) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_292) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_291) c_create_data_~data~0.base) .cse2) v_ArrVal_293) c_create_data_~data~0.base) .cse2)))))) is different from false [2024-11-13 16:33:30,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_291))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_292) .cse2 v_ArrVal_293) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_294) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_292) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse3) v_ArrVal_293) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-13 16:33:30,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_291))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_292) .cse1 v_ArrVal_293) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_292) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_291) c_create_data_~data~0.base) .cse2) v_ArrVal_293) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-13 16:33:30,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:30,083 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-13 16:33:30,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:30,096 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-13 16:33:30,106 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 754 treesize of output 640 [2024-11-13 16:33:30,141 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 415 treesize of output 385 [2024-11-13 16:33:30,155 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 132 treesize of output 124 [2024-11-13 16:33:30,161 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 124 treesize of output 112 [2024-11-13 16:33:30,167 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 112 treesize of output 84 [2024-11-13 16:33:30,177 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 69 treesize of output 65 [2024-11-13 16:33:30,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:30,225 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-13 16:33:30,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:30,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-13 16:33:30,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:33:30,243 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 34 treesize of output 22 [2024-11-13 16:33:30,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 16:33:30,250 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 22 treesize of output 10 [2024-11-13 16:33:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-13 16:33:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515603178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:33:30,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:33:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2024-11-13 16:33:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449723997] [2024-11-13 16:33:30,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:33:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 16:33:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:33:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 16:33:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=455, Unknown=10, NotChecked=240, Total=812 [2024-11-13 16:33:30,299 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:33:31,563 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2024-11-13 16:33:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:33:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 16:33:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:33:31,565 INFO L225 Difference]: With dead ends: 237 [2024-11-13 16:33:31,565 INFO L226 Difference]: Without dead ends: 237 [2024-11-13 16:33:31,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=662, Unknown=10, NotChecked=290, Total=1122 [2024-11-13 16:33:31,567 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 4 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 16:33:31,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1313 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 680 Invalid, 22 Unknown, 464 Unchecked, 0.9s Time] [2024-11-13 16:33:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-13 16:33:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-13 16:33:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.4065934065934067) internal successors, (256), 232 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 16:33:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2024-11-13 16:33:31,583 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 28 [2024-11-13 16:33:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:33:31,583 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2024-11-13 16:33:31,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:33:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2024-11-13 16:33:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 16:33:31,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:33:31,584 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:33:31,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 16:33:31,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 16:33:31,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 16:33:31,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:33:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2029348340, now seen corresponding path program 3 times [2024-11-13 16:33:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:33:31,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664858417] [2024-11-13 16:33:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:33:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:33:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:33:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:33:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664858417] [2024-11-13 16:33:32,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664858417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:33:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177189151] [2024-11-13 16:33:32,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:33:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:33:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:33:32,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:33:32,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b326199-deb7-4a3c-91da-4768c1039696/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:33:33,093 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-13 16:33:33,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:33:33,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 16:33:33,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:33:33,109 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 7 treesize of output 3 [2024-11-13 16:33:33,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 16:33:33,138 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 13 treesize of output 1 [2024-11-13 16:33:33,144 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 10 treesize of output 8 [2024-11-13 16:33:33,192 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 15 treesize of output 1 [2024-11-13 16:33:33,201 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 11 treesize of output 7 [2024-11-13 16:33:33,386 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:33:33,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 16:33:33,396 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 24 treesize of output 11 [2024-11-13 16:33:33,553 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:33:33,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 16:33:33,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 24 treesize of output 11 [2024-11-13 16:33:33,730 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:33:33,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 16:33:33,738 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 24 treesize of output 11 [2024-11-13 16:33:33,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 16:33:33,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 16:33:33,945 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 35 treesize of output 11 [2024-11-13 16:33:34,031 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 25 treesize of output 13 [2024-11-13 16:33:34,038 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 7 treesize of output 3 [2024-11-13 16:33:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:33:34,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:33:34,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4))) (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base|)) (.cse3 (+ |c_create_data_#t~mem8.offset| .cse1))) (and (forall ((v_ArrVal_395 (Array Int Int))) (or (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_395) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_394) c_create_data_~data~0.base) .cse0)))) (not (= v_ArrVal_395 (store .cse2 .cse3 (select v_ArrVal_395 .cse3)))))) (forall ((v_ArrVal_395 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_395) c_create_data_~data~0.base) .cse0) .cse1)) (not (= v_ArrVal_395 (store .cse2 .cse3 (select v_ArrVal_395 .cse3))))))))) is different from false [2024-11-13 16:33:34,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2) .cse0))) (and (forall ((v_ArrVal_395 (Array Int Int))) (or (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_394) c_create_data_~data~0.base) .cse2)))) (not (= v_ArrVal_395 (store .cse3 .cse4 (select v_ArrVal_395 .cse4)))))) (forall ((v_ArrVal_395 (Array Int Int))) (or (not (= v_ArrVal_395 (store .cse3 .cse4 (select v_ArrVal_395 .cse4)))) (< 0 (+ 5 .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2))))))))) is different from false [2024-11-13 16:33:34,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2) .cse0 4))) (and (forall ((v_ArrVal_395 (Array Int Int))) (or (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_394) c_create_data_~data~0.base) .cse2)))) (not (= v_ArrVal_395 (store .cse3 .cse4 (select v_ArrVal_395 .cse4)))))) (forall ((v_ArrVal_395 (Array Int Int))) (or (< 0 (+ 9 .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2))) (not (= v_ArrVal_395 (store .cse3 .cse4 (select v_ArrVal_395 .cse4)))))))))) is different from false [2024-11-13 16:33:34,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_392))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_393)) (.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (or (not (= v_ArrVal_395 (let ((.cse2 (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_395 .cse2))))) (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse3) .cse4 12) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_394) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_393)) (.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_392) c_create_data_~data~0.base) .cse3))) (or (not (= v_ArrVal_395 (let ((.cse8 (+ (select (select .cse6 c_create_data_~data~0.base) .cse3) .cse4 4))) (store (select .cse6 .cse7) .cse8 (select v_ArrVal_395 .cse8))))) (< 0 (+ 9 (select (select (store .cse6 .cse7 v_ArrVal_395) c_create_data_~data~0.base) .cse3) .cse4))))))) is different from false [2024-11-13 16:33:34,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_392) c_create_data_~data~0.base) .cse2)) (.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_393))) (or (< 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2) 9 .cse3)) (not (= v_ArrVal_395 (let ((.cse4 (+ .cse3 (select (select .cse0 c_create_data_~data~0.base) .cse2) 4))) (store (select .cse0 .cse1) .cse4 (select v_ArrVal_395 .cse4)))))))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_392))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_393))) (or (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse6 .cse7 v_ArrVal_395) c_create_data_~data~0.base) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_394) c_create_data_~data~0.base) .cse2)))) (not (= v_ArrVal_395 (let ((.cse9 (+ .cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2) 4))) (store (select .cse6 .cse7) .cse9 (select v_ArrVal_395 .cse9)))))))))))) is different from false [2024-11-13 16:33:34,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_392) c_create_data_~data~0.base) .cse2)) (.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_393))) (or (< 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2) .cse3 13)) (not (= (let ((.cse4 (+ .cse3 (select (select .cse0 c_create_data_~data~0.base) .cse2) 8))) (store (select .cse0 .cse1) .cse4 (select v_ArrVal_395 .cse4))) v_ArrVal_395))))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_392))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_393))) (or (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse6 .cse7 v_ArrVal_395) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_394) c_create_data_~data~0.base) .cse2)))) (not (= (let ((.cse9 (+ .cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2) 8))) (store (select .cse6 .cse7) .cse9 (select v_ArrVal_395 .cse9))) v_ArrVal_395))))))))) is different from false [2024-11-13 16:33:34,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_391))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse7 .cse6 v_ArrVal_392))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_390) .cse6 v_ArrVal_393)) (.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (or (not (= v_ArrVal_395 (let ((.cse2 (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 8))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_395 .cse2))))) (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse3) 16 .cse4) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_394) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_391))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse9 (select (select (store .cse12 .cse11 v_ArrVal_392) c_create_data_~data~0.base) .cse3)) (.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_390) .cse11 v_ArrVal_393))) (or (< 0 (+ (select (select (store .cse8 .cse9 v_ArrVal_395) c_create_data_~data~0.base) .cse3) .cse4 13)) (not (= v_ArrVal_395 (let ((.cse10 (+ (select (select .cse8 c_create_data_~data~0.base) .cse3) .cse4 8))) (store (select .cse8 .cse9) .cse10 (select v_ArrVal_395 .cse10)))))))))))) is different from false [2024-11-13 16:33:34,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_391))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (select (select (store .cse7 .cse6 v_ArrVal_392) c_create_data_~data~0.base) .cse2)) (.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_390) .cse6 v_ArrVal_393))) (or (< 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2) .cse3 13)) (not (= v_ArrVal_395 (let ((.cse4 (+ (select (select .cse0 c_create_data_~data~0.base) .cse2) .cse3 8))) (store (select .cse0 .cse1) .cse4 (select v_ArrVal_395 .cse4)))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_391))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (let ((.cse11 (store .cse13 .cse12 v_ArrVal_392))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_390) .cse12 v_ArrVal_393)) (.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (or (not (= v_ArrVal_395 (let ((.cse10 (+ (select (select .cse8 c_create_data_~data~0.base) .cse2) .cse3 8))) (store (select .cse8 .cse9) .cse10 (select v_ArrVal_395 .cse10))))) (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse8 .cse9 v_ArrVal_395) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_394) c_create_data_~data~0.base) .cse2))))))))))))) is different from false [2024-11-13 16:33:34,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_391))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_392))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_390) .cse7 v_ArrVal_393)) (.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (or (not (= v_ArrVal_395 (let ((.cse2 (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 12))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_395 .cse2))))) (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse1 v_ArrVal_394) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_391))) (let ((.cse13 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_390) .cse13 v_ArrVal_393)) (.cse10 (select (select (store .cse12 .cse13 v_ArrVal_392) c_create_data_~data~0.base) .cse3))) (or (not (= v_ArrVal_395 (let ((.cse11 (+ (select (select .cse9 c_create_data_~data~0.base) .cse3) .cse4 12))) (store (select .cse9 .cse10) .cse11 (select v_ArrVal_395 .cse11))))) (< 0 (+ (select (select (store .cse9 .cse10 v_ArrVal_395) c_create_data_~data~0.base) .cse3) .cse4 17)))))))))) is different from false [2024-11-13 16:33:34,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_388))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_391))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_389) .cse7 v_ArrVal_390) .cse6 v_ArrVal_393)) (.cse1 (select (select (store .cse5 .cse6 v_ArrVal_392) c_create_data_~data~0.base) .cse4))) (or (not (= v_ArrVal_395 (let ((.cse2 (+ .cse3 (select (select .cse0 c_create_data_~data~0.base) .cse4) 12))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_395 .cse2))))) (< 0 (+ .cse3 (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse4) 17))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_388))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_391))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_392))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_389) .cse13 v_ArrVal_390) .cse14 v_ArrVal_393)) (.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (or (not (= v_ArrVal_395 (let ((.cse11 (+ .cse3 (select (select .cse9 c_create_data_~data~0.base) .cse4) 12))) (store (select .cse9 .cse10) .cse11 (select v_ArrVal_395 .cse11))))) (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ .cse3 (select (select (store .cse9 .cse10 v_ArrVal_395) c_create_data_~data~0.base) .cse4) 20) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_394) c_create_data_~data~0.base) .cse4)))))))))))))) is different from false [2024-11-13 16:33:34,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_388))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_391))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_392))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3)) (.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_389) .cse7 v_ArrVal_390) .cse8 v_ArrVal_393))) (or (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ .cse0 (select (select (store .cse1 .cse2 v_ArrVal_395) c_create_data_~data~0.base) .cse3) 20) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_394) c_create_data_~data~0.base) .cse3)))) (not (= v_ArrVal_395 (let ((.cse5 (+ (select (select .cse1 c_create_data_~data~0.base) .cse3) .cse0 12))) (store (select .cse1 .cse2) .cse5 (select v_ArrVal_395 .cse5))))))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_388))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse3))) (let ((.cse14 (store .cse17 .cse16 v_ArrVal_391))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_389) .cse16 v_ArrVal_390) .cse15 v_ArrVal_393)) (.cse12 (select (select (store .cse14 .cse15 v_ArrVal_392) c_create_data_~data~0.base) .cse3))) (or (not (= v_ArrVal_395 (let ((.cse13 (+ (select (select .cse11 c_create_data_~data~0.base) .cse3) .cse0 12))) (store (select .cse11 .cse12) .cse13 (select v_ArrVal_395 .cse13))))) (< 0 (+ .cse0 (select (select (store .cse11 .cse12 v_ArrVal_395) c_create_data_~data~0.base) .cse3) 17)))))))))))) is different from false [2024-11-13 16:33:35,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_388))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_391))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (select (select (store .cse7 .cse6 v_ArrVal_392) c_create_data_~data~0.base) .cse2)) (.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_389) .cse5 v_ArrVal_390) .cse6 v_ArrVal_393))) (or (< 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_395) c_create_data_~data~0.base) .cse2) 17)) (not (= v_ArrVal_395 (let ((.cse3 (+ (select (select .cse0 c_create_data_~data~0.base) .cse2) 12))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_395 .cse3)))))))))))) (forall ((v_ArrVal_391 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_388))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_391))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_392))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_389) .cse13 v_ArrVal_390) .cse14 v_ArrVal_393)) (.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse2))) (or (not (= v_ArrVal_395 (let ((.cse11 (+ (select (select .cse9 c_create_data_~data~0.base) .cse2) 12))) (store (select .cse9 .cse10) .cse11 (select v_ArrVal_395 .cse11))))) (forall ((v_ArrVal_394 (Array Int Int))) (<= (+ (select (select (store .cse9 .cse10 v_ArrVal_395) c_create_data_~data~0.base) .cse2) 20) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_394) c_create_data_~data~0.base) .cse2))))))))))))))) is different from false [2024-11-13 16:33:35,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:35,037 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 528 treesize of output 498 [2024-11-13 16:33:35,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:35,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 488 treesize of output 298 [2024-11-13 16:33:35,073 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 16438 treesize of output 13876 [2024-11-13 16:33:35,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:35,171 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40052 treesize of output 39316 [2024-11-13 16:33:35,399 INFO L349 Elim1Store]: treesize reduction 96, result has 59.8 percent of original size [2024-11-13 16:33:35,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 538 treesize of output 735 [2024-11-13 16:33:35,453 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 367 treesize of output 319 [2024-11-13 16:33:35,485 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 331 treesize of output 263 [2024-11-13 16:33:35,572 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-13 16:33:35,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 398 treesize of output 371 [2024-11-13 16:33:35,674 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-13 16:33:35,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 376 treesize of output 354 [2024-11-13 16:33:35,726 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 232 treesize of output 208 [2024-11-13 16:33:35,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:35,895 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 24 treesize of output 28 [2024-11-13 16:33:35,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:35,990 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 24 treesize of output 28 [2024-11-13 16:33:36,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:36,136 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 24 treesize of output 28 [2024-11-13 16:33:36,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:36,252 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 24 treesize of output 28 [2024-11-13 16:33:36,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:36,331 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 24 treesize of output 28 [2024-11-13 16:33:36,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:36,409 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 24 treesize of output 28 [2024-11-13 16:33:41,618 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 21 treesize of output 1 [2024-11-13 16:33:41,835 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 9 treesize of output 1 [2024-11-13 16:33:41,903 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 13 treesize of output 1 [2024-11-13 16:33:41,978 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 21 treesize of output 1 [2024-11-13 16:33:42,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 21 treesize of output 1 [2024-11-13 16:33:43,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:43,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 500 treesize of output 436 [2024-11-13 16:33:44,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:44,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:44,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 172 treesize of output 172 [2024-11-13 16:33:44,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:44,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:44,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:44,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 89 [2024-11-13 16:33:44,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:44,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:44,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 16:33:44,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2024-11-13 16:33:45,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:33:45,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 320 [2024-11-13 16:35:35,991 INFO L224 Elim1Store]: Index analysis took 1693 ms