./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/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_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1 --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-d790fec [2024-12-01 23:07:58,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-01 23:07:58,308 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-01 23:07:58,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-01 23:07:58,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-01 23:07:58,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-01 23:07:58,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-01 23:07:58,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-01 23:07:58,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-01 23:07:58,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-01 23:07:58,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-01 23:07:58,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-01 23:07:58,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-01 23:07:58,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-01 23:07:58,335 INFO L153 SettingsManager]: * Use SBE=true [2024-12-01 23:07:58,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-01 23:07:58,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-01 23:07:58,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-01 23:07:58,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-01 23:07:58,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:07:58,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:07:58,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-01 23:07:58,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-01 23:07:58,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-01 23:07:58,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-01 23:07:58,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-01 23:07:58,338 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_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1 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-12-01 23:07:58,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-01 23:07:58,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-01 23:07:58,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-01 23:07:58,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-01 23:07:58,569 INFO L274 PluginConnector]: CDTParser initialized [2024-12-01 23:07:58,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-12-01 23:08:01,242 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/32dae376e/85fe291b0e2f47a687b881f5fb4b26a8/FLAGe961e474c [2024-12-01 23:08:01,536 INFO L384 CDTParser]: Found 1 translation units. [2024-12-01 23:08:01,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-12-01 23:08:01,548 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/32dae376e/85fe291b0e2f47a687b881f5fb4b26a8/FLAGe961e474c [2024-12-01 23:08:01,834 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/32dae376e/85fe291b0e2f47a687b881f5fb4b26a8 [2024-12-01 23:08:01,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-01 23:08:01,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-01 23:08:01,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-01 23:08:01,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-01 23:08:01,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-01 23:08:01,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:08:01" (1/1) ... [2024-12-01 23:08:01,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3538c1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:01, skipping insertion in model container [2024-12-01 23:08:01,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:08:01" (1/1) ... [2024-12-01 23:08:01,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-01 23:08:02,052 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-01 23:08:02,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:08:02,077 INFO L200 MainTranslator]: Completed pre-run [2024-12-01 23:08:02,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:08:02,147 INFO L204 MainTranslator]: Completed translation [2024-12-01 23:08:02,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02 WrapperNode [2024-12-01 23:08:02,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-01 23:08:02,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-01 23:08:02,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-01 23:08:02,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-01 23:08:02,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,182 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-12-01 23:08:02,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-01 23:08:02,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-01 23:08:02,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-01 23:08:02,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-01 23:08:02,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,217 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-12-01 23:08:02,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-01 23:08:02,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-01 23:08:02,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-01 23:08:02,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-01 23:08:02,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (1/1) ... [2024-12-01 23:08:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:08:02,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:08:02,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-01 23:08:02,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-01 23:08:02,299 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-12-01 23:08:02,300 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-12-01 23:08:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-01 23:08:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-01 23:08:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-01 23:08:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-01 23:08:02,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-01 23:08:02,412 INFO L234 CfgBuilder]: Building ICFG [2024-12-01 23:08:02,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-01 23:08:02,892 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-12-01 23:08:02,892 INFO L283 CfgBuilder]: Performing block encoding [2024-12-01 23:08:02,905 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-01 23:08:02,905 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-01 23:08:02,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:08:02 BoogieIcfgContainer [2024-12-01 23:08:02,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-01 23:08:02,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-01 23:08:02,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-01 23:08:02,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-01 23:08:02,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 11:08:01" (1/3) ... [2024-12-01 23:08:02,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b89b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:08:02, skipping insertion in model container [2024-12-01 23:08:02,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:08:02" (2/3) ... [2024-12-01 23:08:02,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b89b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:08:02, skipping insertion in model container [2024-12-01 23:08:02,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:08:02" (3/3) ... [2024-12-01 23:08:02,915 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-12-01 23:08:02,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-01 23:08:02,928 INFO L151 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-12-01 23:08:02,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 23:08:02,984 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;@626c18b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 23:08:02,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-12-01 23:08:02,988 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-12-01 23:08:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-01 23:08:02,992 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:02,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-01 23:08:02,992 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-12-01 23:08:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 4929960, now seen corresponding path program 1 times [2024-12-01 23:08:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000526220] [2024-12-01 23:08:03,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000526220] [2024-12-01 23:08:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000526220] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:08:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330609031] [2024-12-01 23:08:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:03,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 23:08:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:03,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 23:08:03,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:08:03,151 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-12-01 23:08:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:03,177 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-12-01 23:08:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 23:08:03,179 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-12-01 23:08:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:03,186 INFO L225 Difference]: With dead ends: 193 [2024-12-01 23:08:03,186 INFO L226 Difference]: Without dead ends: 191 [2024-12-01 23:08:03,188 INFO L434 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-12-01 23:08:03,191 INFO L435 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-12-01 23:08:03,191 INFO L436 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-12-01 23:08:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-12-01 23:08:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-12-01 23:08:03,224 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-12-01 23:08:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2024-12-01 23:08:03,231 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 4 [2024-12-01 23:08:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:03,231 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2024-12-01 23:08:03,232 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-12-01 23:08:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2024-12-01 23:08:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-01 23:08:03,232 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:03,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-01 23:08:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-01 23:08:03,233 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-12-01 23:08:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 4927557, now seen corresponding path program 1 times [2024-12-01 23:08:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773072057] [2024-12-01 23:08:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773072057] [2024-12-01 23:08:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773072057] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:03,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:03,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:08:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916918838] [2024-12-01 23:08:03,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 23:08:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:03,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 23:08:03,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 23:08:03,388 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-12-01 23:08:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:03,677 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-12-01 23:08:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 23:08:03,678 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-12-01 23:08:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:03,679 INFO L225 Difference]: With dead ends: 185 [2024-12-01 23:08:03,679 INFO L226 Difference]: Without dead ends: 185 [2024-12-01 23:08:03,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:08:03,680 INFO L435 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.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:03,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 312 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-01 23:08:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-12-01 23:08:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-12-01 23:08:03,689 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-12-01 23:08:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2024-12-01 23:08:03,692 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2024-12-01 23:08:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:03,692 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2024-12-01 23:08:03,693 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-12-01 23:08:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2024-12-01 23:08:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-01 23:08:03,693 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:03,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-01 23:08:03,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-01 23:08:03,694 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-12-01 23:08:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 4927558, now seen corresponding path program 1 times [2024-12-01 23:08:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:03,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219964466] [2024-12-01 23:08:03,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219964466] [2024-12-01 23:08:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219964466] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:08:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118697303] [2024-12-01 23:08:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:03,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 23:08:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 23:08:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 23:08:03,844 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-12-01 23:08:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:04,139 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-12-01 23:08:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 23:08:04,140 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-12-01 23:08:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:04,142 INFO L225 Difference]: With dead ends: 201 [2024-12-01 23:08:04,142 INFO L226 Difference]: Without dead ends: 201 [2024-12-01 23:08:04,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:08:04,142 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12-01 23:08:04,143 INFO L436 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-12-01 23:08:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-01 23:08:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-12-01 23:08:04,153 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-12-01 23:08:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-12-01 23:08:04,154 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2024-12-01 23:08:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-12-01 23:08:04,154 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-12-01 23:08:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-12-01 23:08:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-01 23:08:04,155 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:04,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-01 23:08:04,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-01 23:08:04,155 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-12-01 23:08:04,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 152754377, now seen corresponding path program 1 times [2024-12-01 23:08:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:04,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042454777] [2024-12-01 23:08:04,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:04,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042454777] [2024-12-01 23:08:04,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042454777] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:08:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584357265] [2024-12-01 23:08:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:08:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:04,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:08:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:04,199 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-12-01 23:08:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:04,322 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2024-12-01 23:08:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:08:04,322 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-12-01 23:08:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:04,323 INFO L225 Difference]: With dead ends: 188 [2024-12-01 23:08:04,323 INFO L226 Difference]: Without dead ends: 188 [2024-12-01 23:08:04,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:04,324 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:04,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:08:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-12-01 23:08:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-12-01 23:08:04,337 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-12-01 23:08:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-12-01 23:08:04,339 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2024-12-01 23:08:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:04,339 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-12-01 23:08:04,340 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-12-01 23:08:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-12-01 23:08:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-01 23:08:04,340 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:04,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-01 23:08:04,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-01 23:08:04,340 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-12-01 23:08:04,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash 152754378, now seen corresponding path program 1 times [2024-12-01 23:08:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534621211] [2024-12-01 23:08:04,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:04,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534621211] [2024-12-01 23:08:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534621211] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:08:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530726625] [2024-12-01 23:08:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:04,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:08:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:04,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:08:04,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:04,396 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-12-01 23:08:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:04,505 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-12-01 23:08:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:08:04,506 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-12-01 23:08:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:04,506 INFO L225 Difference]: With dead ends: 186 [2024-12-01 23:08:04,506 INFO L226 Difference]: Without dead ends: 186 [2024-12-01 23:08:04,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:04,507 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:04,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:08:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-12-01 23:08:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-12-01 23:08:04,513 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-12-01 23:08:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2024-12-01 23:08:04,514 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2024-12-01 23:08:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:04,514 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2024-12-01 23:08:04,515 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-12-01 23:08:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2024-12-01 23:08:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-01 23:08:04,515 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:04,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:04,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-01 23:08:04,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:08:04,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1957144585, now seen corresponding path program 1 times [2024-12-01 23:08:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247206633] [2024-12-01 23:08:04,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247206633] [2024-12-01 23:08:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247206633] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:04,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:04,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:08:04,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506115713] [2024-12-01 23:08:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:04,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:08:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:04,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:08:04,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:08:04,644 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-12-01 23:08:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:04,732 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-12-01 23:08:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:08:04,733 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-12-01 23:08:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:04,734 INFO L225 Difference]: With dead ends: 195 [2024-12-01 23:08:04,734 INFO L226 Difference]: Without dead ends: 195 [2024-12-01 23:08:04,734 INFO L434 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-12-01 23:08:04,734 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-01 23:08:04,735 INFO L436 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-12-01 23:08:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-01 23:08:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-12-01 23:08:04,740 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-12-01 23:08:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-12-01 23:08:04,741 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2024-12-01 23:08:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:04,741 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-12-01 23:08:04,741 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-12-01 23:08:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-12-01 23:08:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-01 23:08:04,742 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:04,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:04,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-01 23:08:04,742 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-12-01 23:08:04,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:04,742 INFO L85 PathProgramCache]: Analyzing trace with hash 376655322, now seen corresponding path program 1 times [2024-12-01 23:08:04,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:04,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804438953] [2024-12-01 23:08:04,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804438953] [2024-12-01 23:08:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804438953] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:04,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 23:08:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470535315] [2024-12-01 23:08:04,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:04,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 23:08:04,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:04,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 23:08:04,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 23:08:04,826 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-12-01 23:08:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:04,856 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2024-12-01 23:08:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:08:04,857 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-12-01 23:08:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:04,858 INFO L225 Difference]: With dead ends: 266 [2024-12-01 23:08:04,858 INFO L226 Difference]: Without dead ends: 266 [2024-12-01 23:08:04,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:08:04,859 INFO L435 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-12-01 23:08:04,859 INFO L436 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-12-01 23:08:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-12-01 23:08:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2024-12-01 23:08:04,865 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-12-01 23:08:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2024-12-01 23:08:04,866 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2024-12-01 23:08:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:04,866 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2024-12-01 23:08:04,867 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-12-01 23:08:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2024-12-01 23:08:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-01 23:08:04,867 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:04,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:04,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-01 23:08:04,867 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-12-01 23:08:04,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580717, now seen corresponding path program 1 times [2024-12-01 23:08:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383303754] [2024-12-01 23:08:04,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:04,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:04,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383303754] [2024-12-01 23:08:04,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383303754] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:04,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:08:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280926414] [2024-12-01 23:08:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:04,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:08:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:04,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:08:04,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:04,940 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-12-01 23:08:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:05,050 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2024-12-01 23:08:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:08:05,050 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-12-01 23:08:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:05,051 INFO L225 Difference]: With dead ends: 215 [2024-12-01 23:08:05,051 INFO L226 Difference]: Without dead ends: 215 [2024-12-01 23:08:05,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:05,052 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:08:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-12-01 23:08:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-12-01 23:08:05,057 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-12-01 23:08:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-12-01 23:08:05,058 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2024-12-01 23:08:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:05,058 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-12-01 23:08:05,059 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-12-01 23:08:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-12-01 23:08:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-01 23:08:05,059 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:05,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:05,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-01 23:08:05,059 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-12-01 23:08:05,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580716, now seen corresponding path program 1 times [2024-12-01 23:08:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777467770] [2024-12-01 23:08:05,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777467770] [2024-12-01 23:08:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777467770] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:08:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446854514] [2024-12-01 23:08:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:08:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:08:05,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:05,156 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-12-01 23:08:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:05,257 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-12-01 23:08:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:08:05,258 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-12-01 23:08:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:05,258 INFO L225 Difference]: With dead ends: 200 [2024-12-01 23:08:05,259 INFO L226 Difference]: Without dead ends: 200 [2024-12-01 23:08:05,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:05,259 INFO L435 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-12-01 23:08:05,260 INFO L436 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-12-01 23:08:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-12-01 23:08:05,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-12-01 23:08:05,264 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-12-01 23:08:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-12-01 23:08:05,265 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2024-12-01 23:08:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:05,265 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-12-01 23:08:05,265 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-12-01 23:08:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-12-01 23:08:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-01 23:08:05,266 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:05,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-01 23:08:05,266 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-12-01 23:08:05,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461590, now seen corresponding path program 1 times [2024-12-01 23:08:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004237797] [2024-12-01 23:08:05,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004237797] [2024-12-01 23:08:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004237797] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 23:08:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579015777] [2024-12-01 23:08:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:05,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:08:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:05,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:08:05,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:08:05,413 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-12-01 23:08:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:05,591 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2024-12-01 23:08:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:08:05,592 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-12-01 23:08:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:05,593 INFO L225 Difference]: With dead ends: 253 [2024-12-01 23:08:05,593 INFO L226 Difference]: Without dead ends: 253 [2024-12-01 23:08:05,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:08:05,594 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12-01 23:08:05,594 INFO L436 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-12-01 23:08:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-12-01 23:08:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2024-12-01 23:08:05,600 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-12-01 23:08:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2024-12-01 23:08:05,601 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2024-12-01 23:08:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:05,601 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2024-12-01 23:08:05,601 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-12-01 23:08:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2024-12-01 23:08:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-01 23:08:05,602 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:05,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:05,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-01 23:08:05,602 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-12-01 23:08:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461589, now seen corresponding path program 1 times [2024-12-01 23:08:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141570192] [2024-12-01 23:08:05,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141570192] [2024-12-01 23:08:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141570192] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:05,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:08:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873338696] [2024-12-01 23:08:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 23:08:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:05,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 23:08:05,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:08:05,847 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-12-01 23:08:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:06,109 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-12-01 23:08:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:08:06,109 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-12-01 23:08:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:06,110 INFO L225 Difference]: With dead ends: 208 [2024-12-01 23:08:06,110 INFO L226 Difference]: Without dead ends: 208 [2024-12-01 23:08:06,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-01 23:08:06,111 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:06,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-01 23:08:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-12-01 23:08:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-12-01 23:08:06,117 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-12-01 23:08:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-12-01 23:08:06,118 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2024-12-01 23:08:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:06,119 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-12-01 23:08:06,119 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-12-01 23:08:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-12-01 23:08:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-01 23:08:06,119 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:06,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:06,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-01 23:08:06,120 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-12-01 23:08:06,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash 617548676, now seen corresponding path program 1 times [2024-12-01 23:08:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634126542] [2024-12-01 23:08:06,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634126542] [2024-12-01 23:08:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634126542] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:08:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070807005] [2024-12-01 23:08:06,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:06,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:06,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:08:06,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:08:06,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-01 23:08:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:06,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-01 23:08:06,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:08:06,540 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-12-01 23:08:06,561 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-12-01 23:08:06,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:06,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:06,652 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-12-01 23:08:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:06,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:08:06,688 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-01 23:08:06,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-12-01 23:08:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070807005] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:08:06,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:08:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-12-01 23:08:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890601237] [2024-12-01 23:08:06,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:08:06,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-01 23:08:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-01 23:08:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=81, Unknown=4, NotChecked=0, Total=110 [2024-12-01 23:08:06,763 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-12-01 23:08:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:07,093 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-12-01 23:08:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:08:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-12-01 23:08:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:07,094 INFO L225 Difference]: With dead ends: 209 [2024-12-01 23:08:07,094 INFO L226 Difference]: Without dead ends: 209 [2024-12-01 23:08:07,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=94, Unknown=4, NotChecked=0, Total=132 [2024-12-01 23:08:07,095 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 24 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:07,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 975 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-01 23:08:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-12-01 23:08:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-12-01 23:08:07,101 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-12-01 23:08:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-12-01 23:08:07,102 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2024-12-01 23:08:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-12-01 23:08:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-12-01 23:08:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-12-01 23:08:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-01 23:08:07,103 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:07,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:07,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-01 23:08:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:07,304 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-12-01 23:08:07,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 617548677, now seen corresponding path program 1 times [2024-12-01 23:08:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156975735] [2024-12-01 23:08:07,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156975735] [2024-12-01 23:08:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156975735] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:08:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753632347] [2024-12-01 23:08:07,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:07,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:08:07,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:08:07,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-01 23:08:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:07,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-12-01 23:08:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:08:07,809 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-12-01 23:08:07,814 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-12-01 23:08:07,817 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-12-01 23:08:07,845 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-12-01 23:08:07,851 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-12-01 23:08:07,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:07,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-01 23:08:07,992 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-12-01 23:08:08,058 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-12-01 23:08:08,065 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-12-01 23:08:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:08,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:08:08,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-12-01 23:08:08,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:08,351 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-12-01 23:08:08,354 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-12-01 23:08:08,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:08,366 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-12-01 23:08:08,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:08,373 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-12-01 23:08:08,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-01 23:08:08,378 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-12-01 23:08:08,383 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-01 23:08:08,385 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-12-01 23:08:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753632347] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:08:08,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:08:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-12-01 23:08:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080771875] [2024-12-01 23:08:08,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:08:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-01 23:08:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:08,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-01 23:08:08,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=329, Unknown=18, NotChecked=38, Total=462 [2024-12-01 23:08:08,418 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-12-01 23:08:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:09,444 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2024-12-01 23:08:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-01 23:08:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-12-01 23:08:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:09,446 INFO L225 Difference]: With dead ends: 227 [2024-12-01 23:08:09,446 INFO L226 Difference]: Without dead ends: 227 [2024-12-01 23:08:09,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=465, Unknown=19, NotChecked=46, Total=650 [2024-12-01 23:08:09,447 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 14 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 3 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:09,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1559 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1137 Invalid, 19 Unknown, 86 Unchecked, 0.9s Time] [2024-12-01 23:08:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-12-01 23:08:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-12-01 23:08:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.430232558139535) internal successors, (246), 222 states have internal predecessors, (246), 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-12-01 23:08:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 250 transitions. [2024-12-01 23:08:09,452 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 250 transitions. Word has length 23 [2024-12-01 23:08:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:09,453 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 250 transitions. [2024-12-01 23:08:09,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-12-01 23:08:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 250 transitions. [2024-12-01 23:08:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-01 23:08:09,454 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:09,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:09,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-01 23:08:09,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:09,654 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-12-01 23:08:09,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1733158075, now seen corresponding path program 2 times [2024-12-01 23:08:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:09,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584743408] [2024-12-01 23:08:09,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-01 23:08:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:09,683 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-01 23:08:09,683 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:08:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:10,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584743408] [2024-12-01 23:08:10,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584743408] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:08:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290002736] [2024-12-01 23:08:10,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-01 23:08:10,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:08:10,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:08:10,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-01 23:08:10,400 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-01 23:08:10,400 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:08:10,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-01 23:08:10,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:08:10,415 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-12-01 23:08:10,422 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-12-01 23:08:10,446 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-12-01 23:08:10,455 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-12-01 23:08:10,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:10,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:10,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-01 23:08:10,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:10,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:10,697 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-12-01 23:08:10,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:10,833 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-12-01 23:08:10,895 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-12-01 23:08:10,901 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-12-01 23:08:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:10,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:08:11,035 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_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-12-01 23:08:11,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-12-01 23:08:11,138 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_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse1 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2024-12-01 23:08:11,167 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$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_307))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_308) .cse3 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_309) c_create_data_~data~0.base) .cse2))))))))) is different from false [2024-12-01 23:08:11,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) .cse0 v_ArrVal_308) (select (select (store .cse1 .cse0 v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310))) c_create_data_~data~0.base) .cse2) .cse3 12))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_307))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) .cse4 v_ArrVal_308) .cse5 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2024-12-01 23:08:13,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:13,245 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 177 treesize of output 178 [2024-12-01 23:08:13,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:13,253 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 167 treesize of output 108 [2024-12-01 23:08:13,265 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 6476 treesize of output 5654 [2024-12-01 23:08:13,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1304 treesize of output 1256 [2024-12-01 23:08:13,323 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 56 treesize of output 52 [2024-12-01 23:08:13,329 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 52 treesize of output 48 [2024-12-01 23:08:13,335 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 48 treesize of output 36 [2024-12-01 23:08:13,342 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 36 treesize of output 32 [2024-12-01 23:08:13,347 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 57 treesize of output 45 [2024-12-01 23:08:13,354 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 16 treesize of output 12 [2024-12-01 23:08:13,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:13,375 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 90 treesize of output 91 [2024-12-01 23:08:13,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:08:13,383 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 80 treesize of output 61 [2024-12-01 23:08:13,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-01 23:08:13,390 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 85 treesize of output 55 [2024-12-01 23:08:13,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-01 23:08:13,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 22 treesize of output 10 [2024-12-01 23:08:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 20 not checked. [2024-12-01 23:08:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290002736] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:08:13,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:08:13,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2024-12-01 23:08:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502161910] [2024-12-01 23:08:13,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:08:13,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-01 23:08:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:13,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-01 23:08:13,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=735, Unknown=30, NotChecked=310, Total=1260 [2024-12-01 23:08:13,439 INFO L87 Difference]: Start difference. First operand 227 states and 250 transitions. Second operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-12-01 23:08:15,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_307))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (<= (+ 16 .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_308) .cse4 v_ArrVal_310) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))))) (<= 0 (+ .cse3 .cse2 4)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse2 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_306))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_305) .cse6 v_ArrVal_308) (select (select (store .cse7 .cse6 v_ArrVal_307) c_create_data_~data~0.base) .cse1) v_ArrVal_310))) c_create_data_~data~0.base) .cse1) 12))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_306))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_307))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (<= (+ 16 .cse2 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_305) .cse8 v_ArrVal_308) .cse9 v_ArrVal_310) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_307) c_create_data_~data~0.base) .cse1) v_ArrVal_310) c_create_data_~data~0.base) .cse1) 12)))))) is different from false [2024-12-01 23:08:15,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse3 v_ArrVal_310) c_create_data_~data~0.base) .cse1) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse1) v_ArrVal_310) c_create_data_~data~0.base) .cse1) 8))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4))) (<= 0 (+ .cse5 .cse2)) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= (+ .cse5 .cse2 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse2)) (<= (+ |c_create_data_#t~mem8.offset| .cse2 4) (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2024-12-01 23:08:15,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse1 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse2) .cse0 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse2) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse2)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse0)) (<= (+ |c_create_data_#t~mem8.offset| .cse0 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2024-12-01 23:08:15,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-12-01 23:08:16,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse0)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2024-12-01 23:08:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:17,081 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2024-12-01 23:08:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-01 23:08:17,082 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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 33 [2024-12-01 23:08:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:17,083 INFO L225 Difference]: With dead ends: 267 [2024-12-01 23:08:17,083 INFO L226 Difference]: Without dead ends: 267 [2024-12-01 23:08:17,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=318, Invalid=1147, Unknown=57, NotChecked=830, Total=2352 [2024-12-01 23:08:17,084 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 16 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 4 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 751 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:17,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1681 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1090 Invalid, 43 Unknown, 751 Unchecked, 2.6s Time] [2024-12-01 23:08:17,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-12-01 23:08:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-12-01 23:08:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 262 states have internal predecessors, (290), 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-12-01 23:08:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 294 transitions. [2024-12-01 23:08:17,090 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 294 transitions. Word has length 33 [2024-12-01 23:08:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:17,090 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 294 transitions. [2024-12-01 23:08:17,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-12-01 23:08:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 294 transitions. [2024-12-01 23:08:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-01 23:08:17,092 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:17,092 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:17,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-01 23:08:17,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:17,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:08:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1907637826, now seen corresponding path program 1 times [2024-12-01 23:08:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085843570] [2024-12-01 23:08:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-01 23:08:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085843570] [2024-12-01 23:08:17,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085843570] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:08:17,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:08:17,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:08:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144404524] [2024-12-01 23:08:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:08:17,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:08:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:17,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:08:17,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:17,362 INFO L87 Difference]: Start difference. First operand 267 states and 294 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-12-01 23:08:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:17,493 INFO L93 Difference]: Finished difference Result 265 states and 290 transitions. [2024-12-01 23:08:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:08:17,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 45 [2024-12-01 23:08:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:17,495 INFO L225 Difference]: With dead ends: 265 [2024-12-01 23:08:17,495 INFO L226 Difference]: Without dead ends: 265 [2024-12-01 23:08:17,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:08:17,496 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:17,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:08:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-12-01 23:08:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-12-01 23:08:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 212 states have (on average 1.349056603773585) internal successors, (286), 260 states have internal predecessors, (286), 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-12-01 23:08:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 290 transitions. [2024-12-01 23:08:17,502 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 290 transitions. Word has length 45 [2024-12-01 23:08:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:17,502 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 290 transitions. [2024-12-01 23:08:17,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-12-01 23:08:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 290 transitions. [2024-12-01 23:08:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-01 23:08:17,503 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:17,503 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:17,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-01 23:08:17,503 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:08:17,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1907637825, now seen corresponding path program 1 times [2024-12-01 23:08:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644147860] [2024-12-01 23:08:17,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:17,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644147860] [2024-12-01 23:08:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644147860] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:08:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132684648] [2024-12-01 23:08:17,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:08:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:08:17,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:08:17,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-01 23:08:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:08:17,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-01 23:08:17,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:08:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:17,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:08:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132684648] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:08:17,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-01 23:08:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-12-01 23:08:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696238272] [2024-12-01 23:08:17,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-01 23:08:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-01 23:08:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:08:17,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-01 23:08:17,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-12-01 23:08:17,927 INFO L87 Difference]: Start difference. First operand 265 states and 290 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-12-01 23:08:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:08:17,998 INFO L93 Difference]: Finished difference Result 289 states and 312 transitions. [2024-12-01 23:08:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-01 23:08:17,998 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 45 [2024-12-01 23:08:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:08:18,000 INFO L225 Difference]: With dead ends: 289 [2024-12-01 23:08:18,000 INFO L226 Difference]: Without dead ends: 289 [2024-12-01 23:08:18,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-12-01 23:08:18,000 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-01 23:08:18,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 630 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-01 23:08:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-12-01 23:08:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-12-01 23:08:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 236 states have (on average 1.305084745762712) internal successors, (308), 284 states have internal predecessors, (308), 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-12-01 23:08:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 312 transitions. [2024-12-01 23:08:18,006 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 312 transitions. Word has length 45 [2024-12-01 23:08:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:08:18,006 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 312 transitions. [2024-12-01 23:08:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-12-01 23:08:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 312 transitions. [2024-12-01 23:08:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-01 23:08:18,007 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:08:18,007 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:08:18,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-12-01 23:08:18,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-01 23:08:18,208 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:08:18,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:08:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash -330159419, now seen corresponding path program 3 times [2024-12-01 23:08:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:08:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206008841] [2024-12-01 23:08:18,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-01 23:08:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:08:18,327 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-12-01 23:08:18,327 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:08:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:08:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206008841] [2024-12-01 23:08:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206008841] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-01 23:08:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519904871] [2024-12-01 23:08:19,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-01 23:08:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:08:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:08:19,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:08:19,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-01 23:08:20,446 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-12-01 23:08:20,446 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:08:20,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-12-01 23:08:20,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:08:20,461 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-12-01 23:08:20,468 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-12-01 23:08:20,478 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-12-01 23:08:20,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-01 23:08:20,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:20,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:20,580 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-12-01 23:08:20,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:20,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:20,708 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-12-01 23:08:20,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:20,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-01 23:08:20,854 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-12-01 23:08:20,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:20,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:20,986 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-12-01 23:08:21,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:21,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-01 23:08:21,158 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-12-01 23:08:21,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:21,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:08:21,343 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-12-01 23:08:21,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:08:21,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-01 23:08:21,525 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-12-01 23:08:21,610 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-12-01 23:08:21,617 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-12-01 23:08:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:08:21,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:08:21,800 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_610 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_609) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-12-01 23:08:21,924 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$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_610 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_609) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-12-01 23:08:21,938 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_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_608) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_607) c_create_data_~data~0.base) .cse0) v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_607))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_608) .cse2 v_ArrVal_610) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_609) c_create_data_~data~0.base) .cse0)))))))) is different from false [2024-12-01 23:08:22,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_607))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_608) .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_609) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_608) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_607) c_create_data_~data~0.base) .cse2) v_ArrVal_610) c_create_data_~data~0.base) .cse2) .cse3 12)))))) is different from false [2024-12-01 23:08:22,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_606))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_607))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_605) .cse0 v_ArrVal_608) .cse1 v_ArrVal_610) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_609) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_606))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_605) .cse6 v_ArrVal_608) (select (select (store .cse7 .cse6 v_ArrVal_607) c_create_data_~data~0.base) .cse2) v_ArrVal_610))) c_create_data_~data~0.base) .cse2) .cse3 12))))) is different from false [2024-12-01 23:08:22,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_607))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse1 v_ArrVal_608) .cse2 v_ArrVal_610) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_609) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse7 v_ArrVal_608) (select (select (store .cse8 .cse7 v_ArrVal_607) c_create_data_~data~0.base) .cse3) v_ArrVal_610))) c_create_data_~data~0.base) .cse3) .cse4 12)))))) is different from false [2024-12-01 23:08:22,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_607))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse1 v_ArrVal_608) .cse2 v_ArrVal_610) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_609) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ 16 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_606))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_605) .cse7 v_ArrVal_608) (select (select (store .cse8 .cse7 v_ArrVal_607) c_create_data_~data~0.base) .cse3) v_ArrVal_610))) c_create_data_~data~0.base) .cse3) .cse4)))))) is different from false [2024-12-01 23:08:22,259 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_604))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_606))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_603) .cse1 v_ArrVal_605) .cse2 v_ArrVal_608) (select (select (store .cse3 .cse2 v_ArrVal_607) c_create_data_~data~0.base) .cse4) v_ArrVal_610))))) c_create_data_~data~0.base) .cse4)))) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_604))) (let ((.cse6 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_606))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_607))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (<= (+ .cse0 20 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_603) .cse6 v_ArrVal_605) .cse7 v_ArrVal_608) .cse8 v_ArrVal_610) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_609) c_create_data_~data~0.base) .cse4)))))))))))) is different from false [2024-12-01 23:08:22,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_606))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_607))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) .cse2 v_ArrVal_608) .cse3 v_ArrVal_610) c_create_data_~data~0.base) .cse4) .cse5 20) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_609) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_606))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse9 v_ArrVal_605) .cse10 v_ArrVal_608) (select (select (store .cse11 .cse10 v_ArrVal_607) c_create_data_~data~0.base) .cse4) v_ArrVal_610))))) c_create_data_~data~0.base) .cse4) 16 .cse5)))))) is different from false [2024-12-01 23:08:22,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_606))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_607))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) .cse2 v_ArrVal_608) .cse3 v_ArrVal_610) c_create_data_~data~0.base) .cse4) .cse5 24) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_609) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_604))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_606))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_603) .cse9 v_ArrVal_605) .cse10 v_ArrVal_608) (select (select (store .cse11 .cse10 v_ArrVal_607) c_create_data_~data~0.base) .cse4) v_ArrVal_610))))) c_create_data_~data~0.base) .cse4) .cse5 20)))))) is different from false [2024-12-01 23:08:23,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse5 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_601))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_607))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) .cse4 v_ArrVal_610) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_609) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_601))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_604))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_606))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_602) .cse10 v_ArrVal_603) .cse11 v_ArrVal_605) .cse12 v_ArrVal_608) (select (select (store .cse13 .cse12 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))) c_create_data_~data~0.base) .cse5) 20))))) is different from false [2024-12-01 23:08:28,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) (select (select (store .cse4 .cse3 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))) c_create_data_~data~0.base) .cse5) .cse8 20))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_604))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_606))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_607))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse9 v_ArrVal_603) .cse10 v_ArrVal_605) .cse11 v_ArrVal_608) .cse12 v_ArrVal_610) c_create_data_~data~0.base) .cse5) .cse8 24) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_609) c_create_data_~data~0.base) .cse5))))))))))))))) is different from false [2024-12-01 23:08:30,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) (select (select (store .cse4 .cse3 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))) c_create_data_~data~0.base) .cse5) .cse8 24))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_601))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_604))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_606))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_607))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_602) .cse9 v_ArrVal_603) .cse10 v_ArrVal_605) .cse11 v_ArrVal_608) .cse12 v_ArrVal_610) c_create_data_~data~0.base) .cse5) .cse8 28) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_609) c_create_data_~data~0.base) .cse5))))))))))))))) is different from false [2024-12-01 23:08:34,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_create_data_~counter~0 4)) (.cse5 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_600))) (let ((.cse0 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_606))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_599) .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) .cse3 v_ArrVal_608) (select (select (store .cse4 .cse3 v_ArrVal_607) c_create_data_~data~0.base) .cse5) v_ArrVal_610))))))))) c_create_data_~data~0.base) .cse5) .cse9 24))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_600))) (let ((.cse10 (select (select .cse19 c_create_data_~data~0.base) .cse5))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_601))) (let ((.cse11 (select (select .cse18 c_create_data_~data~0.base) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_604))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_606))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_607))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_599) .cse10 v_ArrVal_602) .cse11 v_ArrVal_603) .cse12 v_ArrVal_605) .cse13 v_ArrVal_608) .cse14 v_ArrVal_610) c_create_data_~data~0.base) .cse5) .cse9 28) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_609) c_create_data_~data~0.base) .cse5)))))))))))))))) is different from false [2024-12-01 23:08:38,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse6)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_601))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_604))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_606))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_607))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_599) .cse1 v_ArrVal_602) .cse2 v_ArrVal_603) .cse3 v_ArrVal_605) .cse4 v_ArrVal_608) .cse5 v_ArrVal_610) c_create_data_~data~0.base) .cse6) .cse7 28) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_609) c_create_data_~data~0.base) .cse6)))))))))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_600))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_601))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_604))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_606))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_599) .cse13 v_ArrVal_602) .cse14 v_ArrVal_603) .cse15 v_ArrVal_605) .cse16 v_ArrVal_608) (select (select (store .cse17 .cse16 v_ArrVal_607) c_create_data_~data~0.base) .cse6) v_ArrVal_610))))))))) c_create_data_~data~0.base) .cse6) .cse7 24)))))) is different from false [2024-12-01 23:09:25,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_598))) (let ((.cse0 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_601))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_604))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_606))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_607))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ 32 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_597) .cse0 v_ArrVal_599) .cse1 v_ArrVal_602) .cse2 v_ArrVal_603) .cse3 v_ArrVal_605) .cse4 v_ArrVal_608) .cse5 v_ArrVal_610) c_create_data_~data~0.base) .cse6) .cse7) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_609) c_create_data_~data~0.base) .cse6)))))))))))))))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_598 (Array Int Int)) (v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_598))) (let ((.cse14 (select (select .cse23 c_create_data_~data~0.base) .cse6))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_600))) (let ((.cse15 (select (select .cse22 c_create_data_~data~0.base) .cse6))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_601))) (let ((.cse16 (select (select .cse21 c_create_data_~data~0.base) .cse6))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_604))) (let ((.cse17 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_606))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_597) .cse14 v_ArrVal_599) .cse15 v_ArrVal_602) .cse16 v_ArrVal_603) .cse17 v_ArrVal_605) .cse18 v_ArrVal_608) (select (select (store .cse19 .cse18 v_ArrVal_607) c_create_data_~data~0.base) .cse6) v_ArrVal_610))))))))))) c_create_data_~data~0.base) .cse6) .cse7 28))))) is different from false [2024-12-01 23:09:29,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-12-01 23:09:29,346 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-01 23:09:29,347 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-12-01 23:09:29,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-01 23:09:29,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:29,548 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-12-01 23:09:29,552 INFO L158 Benchmark]: Toolchain (without parser) took 87714.81ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 116.4MB in the beginning and 274.2MB in the end (delta: -157.8MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2024-12-01 23:09:29,552 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-01 23:09:29,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.71ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 98.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-01 23:09:29,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.47ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-01 23:09:29,553 INFO L158 Benchmark]: Boogie Preprocessor took 57.57ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-01 23:09:29,553 INFO L158 Benchmark]: RCFGBuilder took 665.45ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 58.5MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-01 23:09:29,553 INFO L158 Benchmark]: TraceAbstraction took 86643.52ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 58.0MB in the beginning and 274.2MB in the end (delta: -216.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-12-01 23:09:29,554 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.71ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 98.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.47ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.57ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 665.45ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 58.5MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 86643.52ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 58.0MB in the beginning and 274.2MB in the end (delta: -216.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/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_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1 --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-d790fec [2024-12-01 23:09:31,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-01 23:09:31,358 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-01 23:09:31,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-01 23:09:31,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-01 23:09:31,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-01 23:09:31,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-01 23:09:31,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-01 23:09:31,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-01 23:09:31,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-01 23:09:31,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-01 23:09:31,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-01 23:09:31,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-01 23:09:31,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-01 23:09:31,386 INFO L153 SettingsManager]: * Use SBE=true [2024-12-01 23:09:31,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-01 23:09:31,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-01 23:09:31,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:09:31,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:09:31,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:09:31,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-01 23:09:31,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-01 23:09:31,389 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_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1 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-12-01 23:09:31,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-01 23:09:31,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-01 23:09:31,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-01 23:09:31,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-01 23:09:31,633 INFO L274 PluginConnector]: CDTParser initialized [2024-12-01 23:09:31,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-12-01 23:09:34,281 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/fc7f8c17b/671d7f31caba46b1a9bb443b4f5ac89f/FLAG0175f9edf [2024-12-01 23:09:34,512 INFO L384 CDTParser]: Found 1 translation units. [2024-12-01 23:09:34,513 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-12-01 23:09:34,526 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/fc7f8c17b/671d7f31caba46b1a9bb443b4f5ac89f/FLAG0175f9edf [2024-12-01 23:09:34,541 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/data/fc7f8c17b/671d7f31caba46b1a9bb443b4f5ac89f [2024-12-01 23:09:34,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-01 23:09:34,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-01 23:09:34,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-01 23:09:34,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-01 23:09:34,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-01 23:09:34,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2399105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34, skipping insertion in model container [2024-12-01 23:09:34,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-01 23:09:34,808 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-01 23:09:34,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:09:34,842 INFO L200 MainTranslator]: Completed pre-run [2024-12-01 23:09:34,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:09:34,915 INFO L204 MainTranslator]: Completed translation [2024-12-01 23:09:34,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34 WrapperNode [2024-12-01 23:09:34,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-01 23:09:34,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-01 23:09:34,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-01 23:09:34,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-01 23:09:34,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,958 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-12-01 23:09:34,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-01 23:09:34,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-01 23:09:34,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-01 23:09:34,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-01 23:09:34,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,997 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-12-01 23:09:34,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:34,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-01 23:09:35,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-01 23:09:35,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-01 23:09:35,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-01 23:09:35,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (1/1) ... [2024-12-01 23:09:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:09:35,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:35,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-01 23:09:35,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-12-01 23:09:35,079 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-01 23:09:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-12-01 23:09:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-12-01 23:09:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-12-01 23:09:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-01 23:09:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-01 23:09:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-12-01 23:09:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-01 23:09:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-01 23:09:35,193 INFO L234 CfgBuilder]: Building ICFG [2024-12-01 23:09:35,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-01 23:09:35,902 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-12-01 23:09:35,903 INFO L283 CfgBuilder]: Performing block encoding [2024-12-01 23:09:35,915 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-01 23:09:35,915 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-01 23:09:35,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:09:35 BoogieIcfgContainer [2024-12-01 23:09:35,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-01 23:09:35,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-01 23:09:35,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-01 23:09:35,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-01 23:09:35,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 11:09:34" (1/3) ... [2024-12-01 23:09:35,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34478fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:09:35, skipping insertion in model container [2024-12-01 23:09:35,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:34" (2/3) ... [2024-12-01 23:09:35,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34478fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:09:35, skipping insertion in model container [2024-12-01 23:09:35,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:09:35" (3/3) ... [2024-12-01 23:09:35,925 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-12-01 23:09:35,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-01 23:09:35,941 INFO L151 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-12-01 23:09:35,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 23:09:35,988 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;@54ee6337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 23:09:35,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-12-01 23:09:35,993 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-12-01 23:09:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-01 23:09:35,998 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:35,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-01 23:09:35,999 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-12-01 23:09:36,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash 4929960, now seen corresponding path program 1 times [2024-12-01 23:09:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:36,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063442189] [2024-12-01 23:09:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:36,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:36,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:36,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:36,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-01 23:09:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:36,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-01 23:09:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:36,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:36,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063442189] [2024-12-01 23:09:36,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063442189] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:36,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:36,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929700292] [2024-12-01 23:09:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:36,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 23:09:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:36,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 23:09:36,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:09:36,152 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-12-01 23:09:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:36,178 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-12-01 23:09:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 23:09:36,180 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-12-01 23:09:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:36,186 INFO L225 Difference]: With dead ends: 193 [2024-12-01 23:09:36,186 INFO L226 Difference]: Without dead ends: 191 [2024-12-01 23:09:36,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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-12-01 23:09:36,191 INFO L435 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-12-01 23:09:36,191 INFO L436 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-12-01 23:09:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-12-01 23:09:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-12-01 23:09:36,226 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-12-01 23:09:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2024-12-01 23:09:36,233 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 4 [2024-12-01 23:09:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:36,233 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2024-12-01 23:09:36,233 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-12-01 23:09:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2024-12-01 23:09:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-01 23:09:36,234 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:36,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-01 23:09:36,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-01 23:09:36,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:36,435 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-12-01 23:09:36,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 4927557, now seen corresponding path program 1 times [2024-12-01 23:09:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812043688] [2024-12-01 23:09:36,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:36,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:36,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:36,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-01 23:09:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:36,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-01 23:09:36,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:36,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-01 23:09:36,608 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-12-01 23:09:36,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-12-01 23:09:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:36,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:36,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812043688] [2024-12-01 23:09:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812043688] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:36,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:09:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272300142] [2024-12-01 23:09:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:36,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 23:09:36,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:36,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 23:09:36,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 23:09:36,624 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-12-01 23:09:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:37,152 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2024-12-01 23:09:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 23:09:37,152 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-12-01 23:09:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:37,153 INFO L225 Difference]: With dead ends: 185 [2024-12-01 23:09:37,153 INFO L226 Difference]: Without dead ends: 185 [2024-12-01 23:09:37,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:09:37,154 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:37,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 312 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-01 23:09:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-12-01 23:09:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-12-01 23:09:37,162 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-12-01 23:09:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2024-12-01 23:09:37,164 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2024-12-01 23:09:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2024-12-01 23:09:37,165 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-12-01 23:09:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2024-12-01 23:09:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-01 23:09:37,165 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:37,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-01 23:09:37,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-01 23:09:37,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:37,367 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-12-01 23:09:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash 4927558, now seen corresponding path program 1 times [2024-12-01 23:09:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699564346] [2024-12-01 23:09:37,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:37,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:37,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:37,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-01 23:09:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:37,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-01 23:09:37,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:37,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-01 23:09:37,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-01 23:09:37,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-01 23:09:37,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-12-01 23:09:37,522 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-12-01 23:09:37,522 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 13 treesize of output 13 [2024-12-01 23:09:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:37,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:37,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699564346] [2024-12-01 23:09:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699564346] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:37,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:09:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620756419] [2024-12-01 23:09:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 23:09:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:37,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 23:09:37,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 23:09:37,541 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-12-01 23:09:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:38,153 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-12-01 23:09:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-01 23:09:38,154 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-12-01 23:09:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:38,155 INFO L225 Difference]: With dead ends: 201 [2024-12-01 23:09:38,155 INFO L226 Difference]: Without dead ends: 201 [2024-12-01 23:09:38,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:09:38,156 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:38,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 352 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-01 23:09:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-01 23:09:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-12-01 23:09:38,164 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-12-01 23:09:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-12-01 23:09:38,166 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2024-12-01 23:09:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:38,166 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-12-01 23:09:38,167 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-12-01 23:09:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-12-01 23:09:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-01 23:09:38,167 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:38,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-01 23:09:38,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-01 23:09:38,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:38,368 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-12-01 23:09:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 152754377, now seen corresponding path program 1 times [2024-12-01 23:09:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:38,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719492845] [2024-12-01 23:09:38,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:38,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:38,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:38,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:38,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-01 23:09:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:38,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-01 23:09:38,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:38,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-01 23:09:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:38,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:38,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:38,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719492845] [2024-12-01 23:09:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719492845] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:38,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118790918] [2024-12-01 23:09:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:38,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:38,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:38,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:38,450 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-12-01 23:09:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:38,723 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2024-12-01 23:09:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:38,724 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-12-01 23:09:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:38,725 INFO L225 Difference]: With dead ends: 188 [2024-12-01 23:09:38,725 INFO L226 Difference]: Without dead ends: 188 [2024-12-01 23:09:38,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-01 23:09:38,726 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:38,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-01 23:09:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-12-01 23:09:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-12-01 23:09:38,733 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-12-01 23:09:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2024-12-01 23:09:38,735 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2024-12-01 23:09:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:38,735 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2024-12-01 23:09:38,735 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-12-01 23:09:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2024-12-01 23:09:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-01 23:09:38,736 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:38,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-01 23:09:38,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-01 23:09:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:38,936 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-12-01 23:09:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 152754378, now seen corresponding path program 1 times [2024-12-01 23:09:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917842743] [2024-12-01 23:09:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:38,939 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:38,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-01 23:09:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:38,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-01 23:09:38,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-01 23:09:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:39,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:39,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:39,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917842743] [2024-12-01 23:09:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917842743] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:39,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003192169] [2024-12-01 23:09:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:39,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:39,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:39,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:39,027 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-12-01 23:09:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:39,316 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-12-01 23:09:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:39,316 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-12-01 23:09:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:39,317 INFO L225 Difference]: With dead ends: 186 [2024-12-01 23:09:39,317 INFO L226 Difference]: Without dead ends: 186 [2024-12-01 23:09:39,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-01 23:09:39,318 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:39,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-01 23:09:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-12-01 23:09:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-12-01 23:09:39,323 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-12-01 23:09:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2024-12-01 23:09:39,324 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2024-12-01 23:09:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:39,324 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2024-12-01 23:09:39,324 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-12-01 23:09:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2024-12-01 23:09:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-01 23:09:39,325 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:39,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:39,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-01 23:09:39,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:39,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:09:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1957144585, now seen corresponding path program 1 times [2024-12-01 23:09:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068453736] [2024-12-01 23:09:39,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:39,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:39,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:39,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-01 23:09:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:39,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-01 23:09:39,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:39,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:39,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068453736] [2024-12-01 23:09:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068453736] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:39,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:39,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:09:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126679468] [2024-12-01 23:09:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:39,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:09:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:39,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:09:39,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:09:39,666 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-12-01 23:09:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:39,873 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-12-01 23:09:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:09:39,874 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-12-01 23:09:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:39,874 INFO L225 Difference]: With dead ends: 195 [2024-12-01 23:09:39,874 INFO L226 Difference]: Without dead ends: 195 [2024-12-01 23:09:39,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-12-01 23:09:39,875 INFO L435 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.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:39,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 714 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-01 23:09:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-01 23:09:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-12-01 23:09:39,880 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-12-01 23:09:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-12-01 23:09:39,881 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2024-12-01 23:09:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:39,881 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-12-01 23:09:39,881 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-12-01 23:09:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-12-01 23:09:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-01 23:09:39,882 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:39,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:39,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-01 23:09:40,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:40,082 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-12-01 23:09:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 376655322, now seen corresponding path program 1 times [2024-12-01 23:09:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932154482] [2024-12-01 23:09:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:40,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:40,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:40,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-01 23:09:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:40,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-01 23:09:40,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:40,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:40,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:40,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932154482] [2024-12-01 23:09:40,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932154482] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:40,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:40,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 23:09:40,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516011673] [2024-12-01 23:09:40,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-01 23:09:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:40,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-01 23:09:40,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-01 23:09:40,178 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-12-01 23:09:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:40,215 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2024-12-01 23:09:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:09:40,215 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-12-01 23:09:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:40,216 INFO L225 Difference]: With dead ends: 266 [2024-12-01 23:09:40,217 INFO L226 Difference]: Without dead ends: 266 [2024-12-01 23:09:40,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-12-01 23:09:40,217 INFO L435 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-12-01 23:09:40,218 INFO L436 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-12-01 23:09:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-12-01 23:09:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2024-12-01 23:09:40,223 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-12-01 23:09:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2024-12-01 23:09:40,225 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2024-12-01 23:09:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:40,225 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2024-12-01 23:09:40,225 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-12-01 23:09:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2024-12-01 23:09:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-01 23:09:40,226 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:40,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:40,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-12-01 23:09:40,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:40,426 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-12-01 23:09:40,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580717, now seen corresponding path program 1 times [2024-12-01 23:09:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697706201] [2024-12-01 23:09:40,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:40,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:40,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:40,428 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:40,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-01 23:09:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:40,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-01 23:09:40,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:40,519 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2024-12-01 23:09:40,519 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 21 treesize of output 15 [2024-12-01 23:09:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:40,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:40,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697706201] [2024-12-01 23:09:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697706201] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549335988] [2024-12-01 23:09:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:40,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:40,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:40,529 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-12-01 23:09:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:40,820 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2024-12-01 23:09:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:40,821 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-12-01 23:09:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:40,822 INFO L225 Difference]: With dead ends: 215 [2024-12-01 23:09:40,822 INFO L226 Difference]: Without dead ends: 215 [2024-12-01 23:09:40,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-01 23:09:40,822 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:40,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-01 23:09:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-12-01 23:09:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-12-01 23:09:40,834 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-12-01 23:09:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-12-01 23:09:40,835 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2024-12-01 23:09:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:40,835 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-12-01 23:09:40,835 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-12-01 23:09:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-12-01 23:09:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-01 23:09:40,835 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:40,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:40,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-01 23:09:41,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:41,036 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-12-01 23:09:41,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1208580716, now seen corresponding path program 1 times [2024-12-01 23:09:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175865077] [2024-12-01 23:09:41,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:41,039 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:41,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-01 23:09:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-01 23:09:41,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:41,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-01 23:09:41,121 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 11 treesize of output 5 [2024-12-01 23:09:41,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-12-01 23:09:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:41,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:41,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175865077] [2024-12-01 23:09:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175865077] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:41,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:41,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509826867] [2024-12-01 23:09:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:41,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:41,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:41,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:41,139 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-12-01 23:09:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:41,411 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-12-01 23:09:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:41,412 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-12-01 23:09:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:41,413 INFO L225 Difference]: With dead ends: 200 [2024-12-01 23:09:41,413 INFO L226 Difference]: Without dead ends: 200 [2024-12-01 23:09:41,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-01 23:09:41,413 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:41,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 207 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-01 23:09:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-12-01 23:09:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-12-01 23:09:41,416 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-12-01 23:09:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-12-01 23:09:41,417 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2024-12-01 23:09:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:41,417 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-12-01 23:09:41,417 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-12-01 23:09:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-12-01 23:09:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-01 23:09:41,418 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:41,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:41,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-01 23:09:41,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:41,619 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-12-01 23:09:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461590, now seen corresponding path program 1 times [2024-12-01 23:09:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011982647] [2024-12-01 23:09:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:41,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:41,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:41,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-01 23:09:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:41,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-01 23:09:41,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:41,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-01 23:09:41,713 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 11 treesize of output 7 [2024-12-01 23:09:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-01 23:09:41,758 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 23 treesize of output 11 [2024-12-01 23:09:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:41,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:41,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011982647] [2024-12-01 23:09:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011982647] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-01 23:09:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766193441] [2024-12-01 23:09:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:09:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:41,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:09:41,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:09:41,772 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-12-01 23:09:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:42,287 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2024-12-01 23:09:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:09:42,288 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-12-01 23:09:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:42,289 INFO L225 Difference]: With dead ends: 253 [2024-12-01 23:09:42,289 INFO L226 Difference]: Without dead ends: 253 [2024-12-01 23:09:42,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-12-01 23:09:42,290 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:42,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 413 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-01 23:09:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-12-01 23:09:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2024-12-01 23:09:42,294 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-12-01 23:09:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2024-12-01 23:09:42,295 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2024-12-01 23:09:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2024-12-01 23:09:42,296 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-12-01 23:09:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2024-12-01 23:09:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-01 23:09:42,296 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:42,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:42,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-01 23:09:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:42,497 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-12-01 23:09:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1061461589, now seen corresponding path program 1 times [2024-12-01 23:09:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085698269] [2024-12-01 23:09:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:42,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:42,499 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:42,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-01 23:09:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:42,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-01 23:09:42,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:42,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-01 23:09:42,603 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 11 treesize of output 5 [2024-12-01 23:09:42,634 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-12-01 23:09:42,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-01 23:09:42,708 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 21 treesize of output 9 [2024-12-01 23:09:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:42,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-01 23:09:42,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085698269] [2024-12-01 23:09:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085698269] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:42,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:09:42,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527591831] [2024-12-01 23:09:42,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:42,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 23:09:42,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:42,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 23:09:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:09:42,738 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-12-01 23:09:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:43,374 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2024-12-01 23:09:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:09:43,374 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-12-01 23:09:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:43,375 INFO L225 Difference]: With dead ends: 208 [2024-12-01 23:09:43,375 INFO L226 Difference]: Without dead ends: 208 [2024-12-01 23:09:43,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-12-01 23:09:43,376 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:43,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-01 23:09:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-12-01 23:09:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-12-01 23:09:43,378 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-12-01 23:09:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2024-12-01 23:09:43,379 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2024-12-01 23:09:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:43,379 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2024-12-01 23:09:43,379 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-12-01 23:09:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2024-12-01 23:09:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-01 23:09:43,380 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:43,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:43,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-01 23:09:43,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:43,581 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-12-01 23:09:43,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash 617548676, now seen corresponding path program 1 times [2024-12-01 23:09:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359123089] [2024-12-01 23:09:43,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:43,583 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:43,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-01 23:09:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:43,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-01 23:09:43,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:43,687 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-12-01 23:09:43,687 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 22 [2024-12-01 23:09:43,718 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-12-01 23:09:43,817 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:43,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-12-01 23:09:43,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-12-01 23:09:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-01 23:09:43,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:09:43,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_158) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))))) is different from false [2024-12-01 23:09:43,981 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse0) v_ArrVal_158) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-12-01 23:09:44,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:44,006 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 26 treesize of output 27 [2024-12-01 23:09:44,009 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 44 treesize of output 32 [2024-12-01 23:09:44,013 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 11 treesize of output 7 [2024-12-01 23:09:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-12-01 23:09:44,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359123089] [2024-12-01 23:09:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359123089] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:09:44,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-01 23:09:44,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-12-01 23:09:44,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574076016] [2024-12-01 23:09:44,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-01 23:09:44,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-01 23:09:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:44,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-01 23:09:44,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2024-12-01 23:09:44,052 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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-12-01 23:09:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:44,860 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2024-12-01 23:09:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-01 23:09:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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-12-01 23:09:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:44,861 INFO L225 Difference]: With dead ends: 209 [2024-12-01 23:09:44,861 INFO L226 Difference]: Without dead ends: 209 [2024-12-01 23:09:44,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2024-12-01 23:09:44,862 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 22 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:44,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 681 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 185 Unchecked, 0.8s Time] [2024-12-01 23:09:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-12-01 23:09:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-12-01 23:09:44,865 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-12-01 23:09:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2024-12-01 23:09:44,866 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2024-12-01 23:09:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:44,866 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2024-12-01 23:09:44,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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-12-01 23:09:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2024-12-01 23:09:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-01 23:09:44,867 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:44,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:44,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-01 23:09:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:45,067 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-12-01 23:09:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 617548677, now seen corresponding path program 1 times [2024-12-01 23:09:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950979005] [2024-12-01 23:09:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:45,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:45,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:45,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-01 23:09:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:45,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-01 23:09:45,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:45,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 10 treesize of output 8 [2024-12-01 23:09:45,185 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 11 treesize of output 5 [2024-12-01 23:09:45,213 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-12-01 23:09:45,220 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-12-01 23:09:45,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:45,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:09:45,367 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-12-01 23:09:45,443 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-12-01 23:09:45,449 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-12-01 23:09:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:45,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:09:45,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_191) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_192) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_191) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-12-01 23:09:45,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_191) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_192) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_191) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-12-01 23:09:45,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_191) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_191) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_192) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-12-01 23:09:45,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:45,843 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 45 treesize of output 46 [2024-12-01 23:09:45,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:45,858 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 35 treesize of output 36 [2024-12-01 23:09:45,863 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 62 treesize of output 50 [2024-12-01 23:09:45,867 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 96 treesize of output 78 [2024-12-01 23:09:45,871 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 15 treesize of output 11 [2024-12-01 23:09:45,873 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 11 treesize of output 7 [2024-12-01 23:09:45,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:45,894 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 45 treesize of output 36 [2024-12-01 23:09:45,900 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 54 treesize of output 36 [2024-12-01 23:09:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-12-01 23:09:45,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950979005] [2024-12-01 23:09:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950979005] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:09:45,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-01 23:09:45,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-12-01 23:09:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501061560] [2024-12-01 23:09:45,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-01 23:09:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-01 23:09:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:45,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-01 23:09:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2024-12-01 23:09:45,950 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 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-12-01 23:09:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:47,399 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2024-12-01 23:09:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-01 23:09:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 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-12-01 23:09:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:47,401 INFO L225 Difference]: With dead ends: 217 [2024-12-01 23:09:47,401 INFO L226 Difference]: Without dead ends: 217 [2024-12-01 23:09:47,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=136, Unknown=3, NotChecked=78, Total=272 [2024-12-01 23:09:47,401 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:47,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 867 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 244 Unchecked, 1.3s Time] [2024-12-01 23:09:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-12-01 23:09:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-12-01 23:09:47,404 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-12-01 23:09:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2024-12-01 23:09:47,405 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 23 [2024-12-01 23:09:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:47,405 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2024-12-01 23:09:47,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 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-12-01 23:09:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2024-12-01 23:09:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-01 23:09:47,406 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:47,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:47,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-01 23:09:47,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:47,606 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-12-01 23:09:47,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash 731740651, now seen corresponding path program 2 times [2024-12-01 23:09:47,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:47,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700741501] [2024-12-01 23:09:47,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-01 23:09:47,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:47,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:47,609 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:47,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-01 23:09:47,745 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-01 23:09:47,745 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:09:47,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-01 23:09:47,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:47,755 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-12-01 23:09:47,765 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 11 treesize of output 5 [2024-12-01 23:09:47,792 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-12-01 23:09:47,800 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-12-01 23:09:47,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:47,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:09:47,971 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-12-01 23:09:48,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:48,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:09:48,113 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-12-01 23:09:48,176 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-12-01 23:09:48,183 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-12-01 23:09:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:48,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:09:48,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_234) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_233) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_234) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-12-01 23:09:48,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_233) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-12-01 23:09:48,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_233) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd (_ bv12 32) .cse3 .cse2))))))) is different from false [2024-12-01 23:09:48,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_232))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_231) .cse0 v_ArrVal_234) c_create_data_~data~0.base) .cse1) (_ bv12 32) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_233) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_231) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_232) c_create_data_~data~0.base) .cse1) v_ArrVal_234) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 (_ bv12 32) .cse2)))))) is different from false [2024-12-01 23:09:48,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_231) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_232) c_create_data_~data~0.base) .cse3) v_ArrVal_234) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_232))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_231) .cse4 v_ArrVal_234) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_233) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-12-01 23:09:48,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_231) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_232) c_create_data_~data~0.base) .cse2) v_ArrVal_234) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_232))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_231) .cse3 v_ArrVal_234) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_233) c_create_data_~data~0.base) .cse2))))))))) is different from false [2024-12-01 23:09:48,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:48,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-12-01 23:09:48,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:48,801 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-12-01 23:09:48,807 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-12-01 23:09:48,817 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-12-01 23:09:48,822 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-12-01 23:09:48,825 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-12-01 23:09:48,829 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-12-01 23:09:48,835 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-12-01 23:09:48,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:48,938 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 80 [2024-12-01 23:09:48,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:48,951 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 69 treesize of output 60 [2024-12-01 23:09:48,960 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 102 treesize of output 84 [2024-12-01 23:09:48,969 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 286 treesize of output 244 [2024-12-01 23:09:48,976 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 48 treesize of output 40 [2024-12-01 23:09:48,984 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 20 treesize of output 12 [2024-12-01 23:09:48,990 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 19 treesize of output 11 [2024-12-01 23:09:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-12-01 23:09:49,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:49,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700741501] [2024-12-01 23:09:49,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700741501] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:09:49,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-01 23:09:49,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-12-01 23:09:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349848715] [2024-12-01 23:09:49,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-01 23:09:49,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-01 23:09:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:49,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-01 23:09:49,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2024-12-01 23:09:49,077 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 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-12-01 23:09:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:09:51,069 INFO L93 Difference]: Finished difference Result 227 states and 248 transitions. [2024-12-01 23:09:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-01 23:09:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 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-12-01 23:09:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:09:51,070 INFO L225 Difference]: With dead ends: 227 [2024-12-01 23:09:51,070 INFO L226 Difference]: Without dead ends: 227 [2024-12-01 23:09:51,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=210, Unknown=6, NotChecked=210, Total=506 [2024-12-01 23:09:51,071 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 4 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-12-01 23:09:51,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1311 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 521 Unchecked, 1.7s Time] [2024-12-01 23:09:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-12-01 23:09:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-12-01 23:09:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.4186046511627908) internal successors, (244), 222 states have internal predecessors, (244), 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-12-01 23:09:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 248 transitions. [2024-12-01 23:09:51,074 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 248 transitions. Word has length 28 [2024-12-01 23:09:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:09:51,075 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 248 transitions. [2024-12-01 23:09:51,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 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-12-01 23:09:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 248 transitions. [2024-12-01 23:09:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-01 23:09:51,075 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:09:51,075 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:51,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-01 23:09:51,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:51,276 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-12-01 23:09:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1733158075, now seen corresponding path program 3 times [2024-12-01 23:09:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:09:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801266611] [2024-12-01 23:09:51,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-01 23:09:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:09:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:51,278 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:09:51,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-01 23:09:52,249 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-12-01 23:09:52,249 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:09:52,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-01 23:09:52,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:09:52,261 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-12-01 23:09:52,270 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 11 treesize of output 5 [2024-12-01 23:09:52,294 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-12-01 23:09:52,303 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-12-01 23:09:52,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:52,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:09:52,474 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-12-01 23:09:52,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:52,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:09:52,650 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-12-01 23:09:52,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:09:52,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:09:52,825 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-12-01 23:09:52,905 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-12-01 23:09:52,911 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-12-01 23:09:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:52,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:09:53,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_283) c_create_data_~data~0.base) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_284) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_283) c_create_data_~data~0.base) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2024-12-01 23:09:53,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-12-01 23:09:53,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-12-01 23:09:53,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_281))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_282) .cse0 v_ArrVal_283) c_create_data_~data~0.base) .cse1) (_ bv12 32) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_281) c_create_data_~data~0.base) .cse1) v_ArrVal_283) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 (_ bv12 32) .cse2)))))) is different from false [2024-12-01 23:09:53,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) (_ bv12 32) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281) c_create_data_~data~0.base) .cse2) v_ArrVal_283) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 (_ bv8 32) .cse3) (bvadd .cse5 (_ bv12 32) .cse3))))))) is different from false [2024-12-01 23:09:53,500 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) (_ bv16 32) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_281) c_create_data_~data~0.base) .cse2) v_ArrVal_283) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 (_ bv12 32) .cse3) (bvadd .cse5 (_ bv16 32) .cse3))))))) is different from false [2024-12-01 23:09:55,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_280))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_281))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_279) .cse0 v_ArrVal_282) .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) (_ bv16 32) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_280))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_279) .cse7 v_ArrVal_282) (select (select (store .cse8 .cse7 v_ArrVal_281) c_create_data_~data~0.base) .cse2) v_ArrVal_283))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 (_ bv12 32) .cse3) (bvadd .cse6 (_ bv16 32) .cse3)))))) is different from false [2024-12-01 23:09:56,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse1 v_ArrVal_282) .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse8 v_ArrVal_282) (select (select (store .cse9 .cse8 v_ArrVal_281) c_create_data_~data~0.base) .cse3) v_ArrVal_283))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) .cse7 .cse4) (bvadd (_ bv16 32) .cse7 .cse4))))))) is different from false [2024-12-01 23:09:56,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_281))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse1 v_ArrVal_282) .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_280))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_279) .cse7 v_ArrVal_282) (select (select (store .cse8 .cse7 v_ArrVal_281) c_create_data_~data~0.base) .cse3) v_ArrVal_283))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) .cse6) (bvadd (_ bv16 32) .cse6))))))) is different from false [2024-12-01 23:09:56,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:56,849 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 177 treesize of output 168 [2024-12-01 23:09:56,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:56,878 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 157 treesize of output 108 [2024-12-01 23:09:56,896 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 588 treesize of output 498 [2024-12-01 23:09:56,918 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 1294 treesize of output 1204 [2024-12-01 23:09:56,946 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 56 treesize of output 48 [2024-12-01 23:09:56,968 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 48 treesize of output 40 [2024-12-01 23:09:56,991 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 40 treesize of output 32 [2024-12-01 23:09:57,007 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 57 treesize of output 49 [2024-12-01 23:09:57,029 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 20 treesize of output 12 [2024-12-01 23:09:57,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:57,120 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 177 treesize of output 178 [2024-12-01 23:09:57,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:09:57,158 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 167 treesize of output 108 [2024-12-01 23:09:57,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-01 23:09:57,179 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 916 treesize of output 610 [2024-12-01 23:09:57,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-01 23:09:57,202 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-12-01 23:09:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2024-12-01 23:09:57,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:09:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801266611] [2024-12-01 23:09:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801266611] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:09:57,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-01 23:09:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2024-12-01 23:09:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595361233] [2024-12-01 23:09:57,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-01 23:09:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-12-01 23:09:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:09:57,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-12-01 23:09:57,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2024-12-01 23:09:57,410 INFO L87 Difference]: Start difference. First operand 227 states and 248 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-12-01 23:10:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:10:04,835 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2024-12-01 23:10:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-01 23:10:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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 33 [2024-12-01 23:10:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:10:04,836 INFO L225 Difference]: With dead ends: 237 [2024-12-01 23:10:04,836 INFO L226 Difference]: Without dead ends: 237 [2024-12-01 23:10:04,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=105, Invalid=302, Unknown=9, NotChecked=396, Total=812 [2024-12-01 23:10:04,837 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 6 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 828 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-12-01 23:10:04,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1758 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 784 Invalid, 0 Unknown, 828 Unchecked, 6.3s Time] [2024-12-01 23:10:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-12-01 23:10:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-12-01 23:10:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 232 states have internal predecessors, (254), 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-12-01 23:10:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2024-12-01 23:10:04,842 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 33 [2024-12-01 23:10:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:10:04,842 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2024-12-01 23:10:04,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-12-01 23:10:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2024-12-01 23:10:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-01 23:10:04,843 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:10:04,843 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:10:04,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-01 23:10:05,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:10:05,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:10:05,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:10:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1913765333, now seen corresponding path program 4 times [2024-12-01 23:10:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:10:05,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965194204] [2024-12-01 23:10:05,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-01 23:10:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:10:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:10:05,046 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:10:05,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-01 23:10:06,927 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-01 23:10:06,927 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:10:06,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-01 23:10:06,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:10:06,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-01 23:10:07,010 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 11 treesize of output 5 [2024-12-01 23:10:07,053 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-12-01 23:10:07,142 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-12-01 23:10:07,181 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-12-01 23:10:07,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:07,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:07,825 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-12-01 23:10:08,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:08,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:08,429 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-12-01 23:10:09,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:09,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:09,107 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-12-01 23:10:09,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:09,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:09,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-01 23:10:10,095 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-12-01 23:10:10,110 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-12-01 23:10:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:10:10,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:10:10,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_341) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_342) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_341) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-12-01 23:10:11,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-12-01 23:10:11,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-12-01 23:10:11,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_339))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_340) .cse0 v_ArrVal_341) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_342) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_339) c_create_data_~data~0.base) .cse1) v_ArrVal_341) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd (_ bv12 32) .cse4 .cse2)))))) is different from false [2024-12-01 23:10:11,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_339))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_340) .cse4 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-12-01 23:10:11,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_339))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_340) .cse1 v_ArrVal_341) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_342) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_339) c_create_data_~data~0.base) .cse2) v_ArrVal_341) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) .cse5 .cse3) (bvadd (_ bv16 32) .cse5 .cse3))))))) is different from false [2024-12-01 23:10:11,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_338))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_339))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_337) .cse0 v_ArrVal_340) .cse1 v_ArrVal_341) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_342) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_338))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_337) .cse7 v_ArrVal_340) (select (select (store .cse8 .cse7 v_ArrVal_339) c_create_data_~data~0.base) .cse2) v_ArrVal_341))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) .cse6 .cse3) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2024-12-01 23:10:11,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) (_ bv16 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse8 v_ArrVal_340) (select (select (store .cse9 .cse8 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 (_ bv12 32) .cse4) (bvadd .cse7 (_ bv16 32) .cse4))))))) is different from false [2024-12-01 23:10:12,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) (_ bv20 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_338))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_337) .cse8 v_ArrVal_340) (select (select (store .cse9 .cse8 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 (_ bv16 32) .cse4) (bvadd .cse7 (_ bv20 32) .cse4))))))) is different from false [2024-12-01 23:10:12,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_335))) (let ((.cse0 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_338))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_336) .cse0 v_ArrVal_337) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_335))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_338))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_336) .cse9 v_ArrVal_337) .cse10 v_ArrVal_340) (select (select (store .cse11 .cse10 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse8 .cse4) (bvadd (_ bv20 32) .cse8 .cse4)))))) is different from false [2024-12-01 23:10:14,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_335))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_338))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_336) .cse3 v_ArrVal_337) .cse4 v_ArrVal_340) (select (select (store .cse5 .cse4 v_ArrVal_339) c_create_data_~data~0.base) .cse6) v_ArrVal_341))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd (_ bv20 32) .cse0 .cse1)))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_335))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_338))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_339))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_336) .cse8 v_ArrVal_337) .cse9 v_ArrVal_340) .cse10 v_ArrVal_341) c_create_data_~data~0.base) .cse6) .cse1) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_342) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2024-12-01 23:10:14,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_335))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_338))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_336) .cse2 v_ArrVal_337) .cse3 v_ArrVal_340) (select (select (store .cse4 .cse3 v_ArrVal_339) c_create_data_~data~0.base) .cse5) v_ArrVal_341))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_335))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_338))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_339))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_336) .cse7 v_ArrVal_337) .cse8 v_ArrVal_340) .cse9 v_ArrVal_341) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_342) c_create_data_~data~0.base) .cse5))))))))))))) is different from false [2024-12-01 23:10:14,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:10:14,855 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 353 treesize of output 354 [2024-12-01 23:10:14,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:10:14,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 204 [2024-12-01 23:10:14,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1621162 treesize of output 1380016 [2024-12-01 23:10:16,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41667 treesize of output 41127 [2024-12-01 23:10:16,118 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 549 treesize of output 485 [2024-12-01 23:10:16,133 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 485 treesize of output 461 [2024-12-01 23:10:16,148 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 461 treesize of output 401 [2024-12-01 23:10:16,164 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 401 treesize of output 381 [2024-12-01 23:10:16,179 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 381 treesize of output 333 [2024-12-01 23:10:16,195 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 333 treesize of output 321 [2024-12-01 23:10:16,218 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 268 treesize of output 264 [2024-12-01 23:10:16,234 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 317 treesize of output 297 [2024-12-01 23:10:17,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:10:17,106 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 353 treesize of output 344 [2024-12-01 23:10:17,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-01 23:10:17,140 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 333 treesize of output 204 [2024-12-01 23:10:17,173 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 6652 treesize of output 5674 [2024-12-01 23:10:17,217 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 17806 treesize of output 17332 [2024-12-01 23:10:17,242 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 89 treesize of output 81 [2024-12-01 23:10:17,259 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 81 treesize of output 73 [2024-12-01 23:10:17,276 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 73 treesize of output 65 [2024-12-01 23:10:17,294 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 65 treesize of output 57 [2024-12-01 23:10:17,312 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 57 treesize of output 49 [2024-12-01 23:10:17,325 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 74 treesize of output 66 [2024-12-01 23:10:17,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 20 treesize of output 12 [2024-12-01 23:10:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2024-12-01 23:10:17,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:10:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965194204] [2024-12-01 23:10:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965194204] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-01 23:10:17,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-01 23:10:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2024-12-01 23:10:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569007991] [2024-12-01 23:10:17,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-01 23:10:17,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-01 23:10:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-01 23:10:17,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-01 23:10:17,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=12, NotChecked=516, Total=870 [2024-12-01 23:10:17,600 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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-12-01 23:10:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-01 23:10:24,394 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2024-12-01 23:10:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-01 23:10:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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 38 [2024-12-01 23:10:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-01 23:10:24,396 INFO L225 Difference]: With dead ends: 247 [2024-12-01 23:10:24,396 INFO L226 Difference]: Without dead ends: 247 [2024-12-01 23:10:24,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=130, Invalid=412, Unknown=12, NotChecked=636, Total=1190 [2024-12-01 23:10:24,397 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1165 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-12-01 23:10:24,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1771 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 617 Invalid, 0 Unknown, 1165 Unchecked, 5.2s Time] [2024-12-01 23:10:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-12-01 23:10:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-12-01 23:10:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 192 states have (on average 1.375) internal successors, (264), 242 states have internal predecessors, (264), 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-12-01 23:10:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions. [2024-12-01 23:10:24,401 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 38 [2024-12-01 23:10:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-01 23:10:24,402 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 268 transitions. [2024-12-01 23:10:24,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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-12-01 23:10:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions. [2024-12-01 23:10:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-01 23:10:24,402 INFO L210 NwaCegarLoop]: Found error trace [2024-12-01 23:10:24,402 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:10:24,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-01 23:10:24,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:10:24,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-12-01 23:10:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:10:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -556500219, now seen corresponding path program 5 times [2024-12-01 23:10:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-01 23:10:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748671513] [2024-12-01 23:10:24,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-01 23:10:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:10:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:10:24,605 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-01 23:10:24,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-01 23:10:28,128 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-12-01 23:10:28,128 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-01 23:10:28,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-01 23:10:28,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-01 23:10:28,165 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-12-01 23:10:28,191 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 11 treesize of output 5 [2024-12-01 23:10:28,301 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-12-01 23:10:28,329 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-12-01 23:10:28,916 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:28,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-01 23:10:28,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 30 treesize of output 13 [2024-12-01 23:10:29,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:29,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:29,608 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-12-01 23:10:30,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:30,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:30,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-01 23:10:31,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-01 23:10:31,165 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-12-01 23:10:31,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-01 23:10:31,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-01 23:10:31,918 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-12-01 23:10:32,268 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-12-01 23:10:32,282 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-12-01 23:10:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:10:32,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-01 23:10:33,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_407) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_407) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_408) c_create_data_~data~0.base) .cse2)))))) is different from false [2024-12-01 23:10:33,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_407) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_408) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_407) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-12-01 23:10:33,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_408) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-12-01 23:10:34,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) .cse4 v_ArrVal_407) c_create_data_~data~0.base) .cse3) (_ bv12 32) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_408) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-12-01 23:10:34,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv12 32) .cse1) (bvadd .cse0 (_ bv16 32) .cse1)))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_405))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_406) .cse4 v_ArrVal_407) c_create_data_~data~0.base) .cse3) (_ bv16 32) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_408) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-12-01 23:10:34,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_403))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_404) .cse2 v_ArrVal_406) (select (select (store .cse3 .cse2 v_ArrVal_405) c_create_data_~data~0.base) .cse4) v_ArrVal_407))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv12 32) .cse0 .cse1) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_403))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_405))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_404) .cse5 v_ArrVal_406) .cse6 v_ArrVal_407) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_408) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2024-12-01 23:10:35,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_405))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse1 v_ArrVal_406) .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_408) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse8 v_ArrVal_406) (select (select (store .cse9 .cse8 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) .cse7 .cse4) (bvadd (_ bv16 32) .cse7 .cse4))))))) is different from false [2024-12-01 23:10:35,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_405))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse1 v_ArrVal_406) .cse2 v_ArrVal_407) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_408) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_403))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_404) .cse8 v_ArrVal_406) (select (select (store .cse9 .cse8 v_ArrVal_405) c_create_data_~data~0.base) .cse3) v_ArrVal_407))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse7 .cse4) (bvadd (_ bv20 32) .cse7 .cse4))))))) is different from false [2024-12-01 23:10:36,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_401))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_403))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_402) .cse2 v_ArrVal_404) .cse3 v_ArrVal_406) (select (select (store .cse4 .cse3 v_ArrVal_405) c_create_data_~data~0.base) .cse5) v_ArrVal_407))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 (_ bv16 32) .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_401))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_403))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_405))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_402) .cse7 v_ArrVal_404) .cse8 v_ArrVal_406) .cse9 v_ArrVal_407) c_create_data_~data~0.base) .cse5) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_408) c_create_data_~data~0.base) .cse5)))))))))))) is different from false [2024-12-01 23:10:39,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_401))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_403))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_405))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_402) .cse1 v_ArrVal_404) .cse2 v_ArrVal_406) .cse3 v_ArrVal_407) c_create_data_~data~0.base) .cse4) .cse5) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_408) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_401))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_403))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_402) .cse10 v_ArrVal_404) .cse11 v_ArrVal_406) (select (select (store .cse12 .cse11 v_ArrVal_405) c_create_data_~data~0.base) .cse4) v_ArrVal_407))))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) .cse9 .cse5) (bvadd (_ bv20 32) .cse9 .cse5))))))) is different from false [2024-12-01 23:10:53,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_399))) (let ((.cse0 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_401))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_403))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_405))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_400) .cse0 v_ArrVal_402) .cse1 v_ArrVal_404) .cse2 v_ArrVal_406) .cse3 v_ArrVal_407) c_create_data_~data~0.base) .cse4) .cse5) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_408) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_399))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_401))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_403))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_400) .cse11 v_ArrVal_402) .cse12 v_ArrVal_404) .cse13 v_ArrVal_406) (select (select (store .cse14 .cse13 v_ArrVal_405) c_create_data_~data~0.base) .cse4) v_ArrVal_407))))))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv20 32) .cse10 .cse5) (bvadd (_ bv24 32) .cse10 .cse5)))))) is different from false [2024-12-01 23:10:58,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-12-01 23:10:58,204 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-01 23:10:58,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-01 23:10:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748671513] [2024-12-01 23:10:58,205 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-12-01 23:10:58,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-01 23:10:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-01 23:10:58,405 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-12-01 23:10:58,409 INFO L158 Benchmark]: Toolchain (without parser) took 83864.07ms. Allocated memory was 92.3MB in the beginning and 327.2MB in the end (delta: 234.9MB). Free memory was 68.4MB in the beginning and 123.3MB in the end (delta: -55.0MB). Peak memory consumption was 178.6MB. Max. memory is 16.1GB. [2024-12-01 23:10:58,409 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-01 23:10:58,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.52ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 49.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-01 23:10:58,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.40ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 47.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-01 23:10:58,410 INFO L158 Benchmark]: Boogie Preprocessor took 61.66ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 44.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-01 23:10:58,410 INFO L158 Benchmark]: RCFGBuilder took 894.72ms. Allocated memory is still 92.3MB. Free memory was 44.0MB in the beginning and 61.4MB in the end (delta: -17.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-12-01 23:10:58,410 INFO L158 Benchmark]: TraceAbstraction took 82490.35ms. Allocated memory was 92.3MB in the beginning and 327.2MB in the end (delta: 234.9MB). Free memory was 61.0MB in the beginning and 123.3MB in the end (delta: -62.4MB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. [2024-12-01 23:10:58,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.52ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 49.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.40ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 47.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.66ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 44.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 894.72ms. Allocated memory is still 92.3MB. Free memory was 44.0MB in the beginning and 61.4MB in the end (delta: -17.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 82490.35ms. Allocated memory was 92.3MB in the beginning and 327.2MB in the end (delta: 234.9MB). Free memory was 61.0MB in the beginning and 123.3MB in the end (delta: -62.4MB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3aa4bd9-30f9-4978-9ee7-f36cd5992120/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")