./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 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/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_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU --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.2.5-dev-4fc63b2 [2024-10-31 22:10:14,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:10:14,985 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:10:14,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:10:14,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:10:15,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:10:15,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:10:15,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:10:15,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:10:15,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:10:15,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:10:15,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:10:15,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:10:15,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:10:15,041 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:10:15,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:10:15,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:10:15,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:10:15,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:10:15,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:10:15,048 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:10:15,049 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:10:15,050 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:10:15,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:10:15,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:10:15,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:10:15,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:10:15,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:10:15,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:10:15,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:10:15,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:10:15,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:10:15,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:10:15,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:15,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:10:15,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:10:15,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:10:15,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:10:15,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:10:15,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:10:15,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:10:15,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:10:15,058 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU 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-10-31 22:10:15,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:10:15,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:10:15,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:10:15,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:10:15,417 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:10:15,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i Unable to find full path for "g++" [2024-10-31 22:10:17,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:10:17,802 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:10:17,806 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-10-31 22:10:17,822 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/data/c735e4266/c2ceecadefa3468da3b7659ff398190d/FLAG6d795c296 [2024-10-31 22:10:17,842 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/data/c735e4266/c2ceecadefa3468da3b7659ff398190d [2024-10-31 22:10:17,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:10:17,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:10:17,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:17,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:10:17,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:10:17,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:17" (1/1) ... [2024-10-31 22:10:17,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483b8b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:17, skipping insertion in model container [2024-10-31 22:10:17,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:17" (1/1) ... [2024-10-31 22:10:17,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:10:18,355 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:10:18,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:18,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:10:18,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:18,513 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:10:18,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18 WrapperNode [2024-10-31 22:10:18,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:18,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:18,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:10:18,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:10:18,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,580 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-10-31 22:10:18,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:18,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:10:18,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:10:18,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:10:18,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,638 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-10-31 22:10:18,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:10:18,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:10:18,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:10:18,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:10:18,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (1/1) ... [2024-10-31 22:10:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:18,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:10:18,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:10:18,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:10:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:10:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:10:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:10:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:10:18,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:10:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:10:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-10-31 22:10:18,845 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-10-31 22:10:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:10:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:10:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:10:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-31 22:10:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-31 22:10:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-31 22:10:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:10:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:10:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:10:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:10:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:10:19,105 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:10:19,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:10:19,820 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-10-31 22:10:19,820 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:10:19,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:10:19,849 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-31 22:10:19,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:19 BoogieIcfgContainer [2024-10-31 22:10:19,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:10:19,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:10:19,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:10:19,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:10:19,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:10:17" (1/3) ... [2024-10-31 22:10:19,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6912618d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:19, skipping insertion in model container [2024-10-31 22:10:19,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:18" (2/3) ... [2024-10-31 22:10:19,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6912618d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:19, skipping insertion in model container [2024-10-31 22:10:19,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:19" (3/3) ... [2024-10-31 22:10:19,858 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-10-31 22:10:19,880 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:10:19,881 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-10-31 22:10:19,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:10:19,949 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;@68fd535c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:10:19,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-10-31 22:10:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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-10-31 22:10:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:10:19,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:19,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:10:19,959 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-10-31 22:10:19,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:19,964 INFO L85 PathProgramCache]: Analyzing trace with hash 4960777, now seen corresponding path program 1 times [2024-10-31 22:10:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044088051] [2024-10-31 22:10:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:20,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:20,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044088051] [2024-10-31 22:10:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044088051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:20,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:20,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:20,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674166885] [2024-10-31 22:10:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:10:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:10:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:10:20,162 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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-10-31 22:10:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:20,200 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-10-31 22:10:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:10:20,203 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-10-31 22:10:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:20,213 INFO L225 Difference]: With dead ends: 195 [2024-10-31 22:10:20,214 INFO L226 Difference]: Without dead ends: 193 [2024-10-31 22:10:20,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:10:20,224 INFO L432 NwaCegarLoop]: 207 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, 207 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-10-31 22:10:20,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:10:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-31 22:10:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-31 22:10:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0510204081632653) internal successors, (201), 189 states have internal predecessors, (201), 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-10-31 22:10:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2024-10-31 22:10:20,288 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 4 [2024-10-31 22:10:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:20,289 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2024-10-31 22:10:20,289 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-10-31 22:10:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2024-10-31 22:10:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:10:20,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:20,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:10:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:10:20,291 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-10-31 22:10:20,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash 4958341, now seen corresponding path program 1 times [2024-10-31 22:10:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:20,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108368598] [2024-10-31 22:10:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:20,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:20,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108368598] [2024-10-31 22:10:20,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108368598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:20,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:20,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:10:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057295260] [2024-10-31 22:10:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:20,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:20,486 INFO L87 Difference]: Start difference. First operand 193 states and 205 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-10-31 22:10:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:20,778 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2024-10-31 22:10:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:20,779 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-10-31 22:10:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:20,780 INFO L225 Difference]: With dead ends: 187 [2024-10-31 22:10:20,783 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:10:20,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:20,784 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 317 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-10-31 22:10:20,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:10:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:10:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-31 22:10:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.989795918367347) 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-10-31 22:10:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-10-31 22:10:20,807 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2024-10-31 22:10:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:20,807 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-10-31 22:10:20,807 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-10-31 22:10:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-10-31 22:10:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:10:20,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:20,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:10:20,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:10:20,808 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-10-31 22:10:20,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 4958342, now seen corresponding path program 1 times [2024-10-31 22:10:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132913844] [2024-10-31 22:10:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:21,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132913844] [2024-10-31 22:10:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132913844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:21,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:10:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842250450] [2024-10-31 22:10:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:21,086 INFO L87 Difference]: Start difference. First operand 187 states and 199 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-10-31 22:10:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:21,480 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2024-10-31 22:10:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:21,484 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-10-31 22:10:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:21,487 INFO L225 Difference]: With dead ends: 203 [2024-10-31 22:10:21,489 INFO L226 Difference]: Without dead ends: 203 [2024-10-31 22:10:21,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:21,491 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 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.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:21,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:10:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-31 22:10:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-10-31 22:10:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.9611650485436893) internal successors, (202), 188 states have internal predecessors, (202), 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-10-31 22:10:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2024-10-31 22:10:21,514 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2024-10-31 22:10:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:21,514 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2024-10-31 22:10:21,514 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-10-31 22:10:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2024-10-31 22:10:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:10:21,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:21,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:10:21,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:10:21,516 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-10-31 22:10:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash 153708682, now seen corresponding path program 1 times [2024-10-31 22:10:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:21,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968606714] [2024-10-31 22:10:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:21,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:21,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968606714] [2024-10-31 22:10:21,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968606714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:21,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:21,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:21,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607148264] [2024-10-31 22:10:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:21,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:21,565 INFO L87 Difference]: Start difference. First operand 192 states and 206 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-10-31 22:10:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:21,739 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2024-10-31 22:10:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:21,739 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-10-31 22:10:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:21,741 INFO L225 Difference]: With dead ends: 190 [2024-10-31 22:10:21,741 INFO L226 Difference]: Without dead ends: 190 [2024-10-31 22:10:21,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:21,744 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:21,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 279 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:10:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-31 22:10:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-31 22:10:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 186 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-10-31 22:10:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2024-10-31 22:10:21,763 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2024-10-31 22:10:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:21,763 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2024-10-31 22:10:21,764 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-10-31 22:10:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2024-10-31 22:10:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:10:21,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:21,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:10:21,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:10:21,769 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-10-31 22:10:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 153708683, now seen corresponding path program 1 times [2024-10-31 22:10:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572727295] [2024-10-31 22:10:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572727295] [2024-10-31 22:10:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572727295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:21,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603939876] [2024-10-31 22:10:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:21,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:21,889 INFO L87 Difference]: Start difference. First operand 190 states and 203 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-10-31 22:10:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:22,069 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2024-10-31 22:10:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:22,070 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-10-31 22:10:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:22,072 INFO L225 Difference]: With dead ends: 188 [2024-10-31 22:10:22,072 INFO L226 Difference]: Without dead ends: 188 [2024-10-31 22:10:22,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:22,075 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:22,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:10:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-31 22:10:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-31 22:10:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 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-10-31 22:10:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2024-10-31 22:10:22,095 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2024-10-31 22:10:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2024-10-31 22:10:22,096 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-10-31 22:10:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2024-10-31 22:10:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 22:10:22,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:22,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:10:22,101 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-10-31 22:10:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1301215081, now seen corresponding path program 1 times [2024-10-31 22:10:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569737846] [2024-10-31 22:10:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569737846] [2024-10-31 22:10:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569737846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:22,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543842168] [2024-10-31 22:10:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:22,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:22,323 INFO L87 Difference]: Start difference. First operand 188 states and 200 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-10-31 22:10:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:22,469 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2024-10-31 22:10:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:10:22,470 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-10-31 22:10:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:22,471 INFO L225 Difference]: With dead ends: 197 [2024-10-31 22:10:22,471 INFO L226 Difference]: Without dead ends: 197 [2024-10-31 22:10:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:10:22,473 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 722 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-10-31 22:10:22,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 722 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:10:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-31 22:10:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2024-10-31 22:10:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.8942307692307692) internal successors, (197), 185 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-10-31 22:10:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2024-10-31 22:10:22,487 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2024-10-31 22:10:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:22,487 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2024-10-31 22:10:22,487 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-10-31 22:10:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2024-10-31 22:10:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-31 22:10:22,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:22,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:22,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:10:22,488 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-10-31 22:10:22,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash -635255016, now seen corresponding path program 1 times [2024-10-31 22:10:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299603630] [2024-10-31 22:10:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299603630] [2024-10-31 22:10:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299603630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078750423] [2024-10-31 22:10:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:22,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:22,574 INFO L87 Difference]: Start difference. First operand 189 states and 201 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-10-31 22:10:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:22,611 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2024-10-31 22:10:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:10:22,612 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-10-31 22:10:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:22,613 INFO L225 Difference]: With dead ends: 269 [2024-10-31 22:10:22,614 INFO L226 Difference]: Without dead ends: 269 [2024-10-31 22:10:22,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:22,615 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 569 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-10-31 22:10:22,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:10:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-31 22:10:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2024-10-31 22:10:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 147 states have (on average 1.91156462585034) internal successors, (281), 228 states have internal predecessors, (281), 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-10-31 22:10:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-10-31 22:10:22,622 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2024-10-31 22:10:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-10-31 22:10:22,625 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-10-31 22:10:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-10-31 22:10:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 22:10:22,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:22,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:10:22,626 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-10-31 22:10:22,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937173, now seen corresponding path program 1 times [2024-10-31 22:10:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084780729] [2024-10-31 22:10:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:22,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:22,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084780729] [2024-10-31 22:10:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084780729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:22,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357185937] [2024-10-31 22:10:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:22,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:22,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:22,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:22,724 INFO L87 Difference]: Start difference. First operand 233 states and 285 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-10-31 22:10:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:22,885 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2024-10-31 22:10:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:22,886 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-10-31 22:10:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:22,887 INFO L225 Difference]: With dead ends: 218 [2024-10-31 22:10:22,887 INFO L226 Difference]: Without dead ends: 218 [2024-10-31 22:10:22,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:22,888 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:22,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 208 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:10:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-31 22:10:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-31 22:10:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 213 states have internal predecessors, (251), 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-10-31 22:10:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2024-10-31 22:10:22,896 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 13 [2024-10-31 22:10:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2024-10-31 22:10:22,897 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-10-31 22:10:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2024-10-31 22:10:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 22:10:22,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:22,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:10:22,900 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-10-31 22:10:22,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937174, now seen corresponding path program 1 times [2024-10-31 22:10:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060875268] [2024-10-31 22:10:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:23,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060875268] [2024-10-31 22:10:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060875268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:23,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169419570] [2024-10-31 22:10:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:23,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:23,049 INFO L87 Difference]: Start difference. First operand 218 states and 255 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-10-31 22:10:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:23,207 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2024-10-31 22:10:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:23,208 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-10-31 22:10:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:23,209 INFO L225 Difference]: With dead ends: 203 [2024-10-31 22:10:23,209 INFO L226 Difference]: Without dead ends: 203 [2024-10-31 22:10:23,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:23,210 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 210 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-10-31 22:10:23,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 210 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:10:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-31 22:10:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-31 22:10:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 198 states have internal predecessors, (221), 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-10-31 22:10:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2024-10-31 22:10:23,217 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 13 [2024-10-31 22:10:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:23,218 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2024-10-31 22:10:23,218 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-10-31 22:10:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2024-10-31 22:10:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:10:23,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:23,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:10:23,220 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-10-31 22:10:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961989, now seen corresponding path program 1 times [2024-10-31 22:10:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461572358] [2024-10-31 22:10:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:23,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461572358] [2024-10-31 22:10:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461572358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:23,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907595774] [2024-10-31 22:10:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:23,349 INFO L87 Difference]: Start difference. First operand 203 states and 225 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-10-31 22:10:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:23,633 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2024-10-31 22:10:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:10:23,633 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-10-31 22:10:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:23,635 INFO L225 Difference]: With dead ends: 256 [2024-10-31 22:10:23,635 INFO L226 Difference]: Without dead ends: 256 [2024-10-31 22:10:23,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:23,636 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 24 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 421 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.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:23,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 421 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:10:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-31 22:10:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 211. [2024-10-31 22:10:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 206 states have internal predecessors, (233), 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-10-31 22:10:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2024-10-31 22:10:23,644 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 18 [2024-10-31 22:10:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:23,644 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2024-10-31 22:10:23,645 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-10-31 22:10:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2024-10-31 22:10:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:10:23,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:23,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:23,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:10:23,646 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-10-31 22:10:23,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961990, now seen corresponding path program 1 times [2024-10-31 22:10:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:23,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821726967] [2024-10-31 22:10:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821726967] [2024-10-31 22:10:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821726967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95082693] [2024-10-31 22:10:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:23,959 INFO L87 Difference]: Start difference. First operand 211 states and 237 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-10-31 22:10:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:24,250 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2024-10-31 22:10:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:24,251 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-10-31 22:10:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:24,252 INFO L225 Difference]: With dead ends: 211 [2024-10-31 22:10:24,252 INFO L226 Difference]: Without dead ends: 211 [2024-10-31 22:10:24,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:10:24,253 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:24,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:10:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-31 22:10:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-31 22:10:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 206 states have internal predecessors, (229), 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-10-31 22:10:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2024-10-31 22:10:24,260 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 18 [2024-10-31 22:10:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:24,260 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2024-10-31 22:10:24,261 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-10-31 22:10:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2024-10-31 22:10:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:10:24,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:24,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:10:24,262 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-10-31 22:10:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431927, now seen corresponding path program 1 times [2024-10-31 22:10:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907625357] [2024-10-31 22:10:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907625357] [2024-10-31 22:10:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907625357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:10:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341878775] [2024-10-31 22:10:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:10:24,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:24,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:10:24,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:10:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:24,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-31 22:10:24,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:24,756 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-31 22:10:24,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-31 22:10:24,809 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-10-31 22:10:24,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:10:24,945 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-10-31 22:10:25,020 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-10-31 22:10:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:10:25,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:10:25,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse0) v_ArrVal_162) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2024-10-31 22:10:25,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:25,196 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-10-31 22:10:25,200 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-10-31 22:10:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-31 22:10:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-31 22:10:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341878775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:10:25,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:10:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-10-31 22:10:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375555456] [2024-10-31 22:10:25,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:10:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 22:10:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 22:10:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2024-10-31 22:10:25,256 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:25,720 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2024-10-31 22:10:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:10:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 22:10:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:25,722 INFO L225 Difference]: With dead ends: 212 [2024-10-31 22:10:25,722 INFO L226 Difference]: Without dead ends: 212 [2024-10-31 22:10:25,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2024-10-31 22:10:25,723 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 44 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:25,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 645 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 367 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2024-10-31 22:10:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-31 22:10:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-10-31 22:10:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 205 states have internal predecessors, (227), 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-10-31 22:10:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2024-10-31 22:10:25,731 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 24 [2024-10-31 22:10:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:25,733 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2024-10-31 22:10:25,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2024-10-31 22:10:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:10:25,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:25,735 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:25,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:10:25,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-31 22:10:25,939 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-10-31 22:10:25,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431926, now seen corresponding path program 1 times [2024-10-31 22:10:25,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:25,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481849832] [2024-10-31 22:10:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481849832] [2024-10-31 22:10:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481849832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:10:26,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565596175] [2024-10-31 22:10:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:10:26,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:26,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:10:26,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:10:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:26,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-31 22:10:26,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:26,631 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-10-31 22:10:26,644 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-10-31 22:10:26,679 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-10-31 22:10:26,692 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-10-31 22:10:26,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:10:26,878 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-10-31 22:10:26,886 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-10-31 22:10:26,995 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-10-31 22:10:27,004 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-10-31 22:10:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:27,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:10:27,187 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_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-10-31 22:10:27,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2024-10-31 22:10:27,241 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_222) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-10-31 22:10:27,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:27,259 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-10-31 22:10:27,262 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-10-31 22:10:27,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:27,279 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-10-31 22:10:27,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:27,288 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-10-31 22:10:27,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:10:27,295 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-10-31 22:10:27,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:10:27,301 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-10-31 22:10:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-31 22:10:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565596175] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:10:27,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:10:27,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-10-31 22:10:27,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710422011] [2024-10-31 22:10:27,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:10:27,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-31 22:10:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-31 22:10:27,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2024-10-31 22:10:27,344 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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-10-31 22:10:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:28,157 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2024-10-31 22:10:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:10:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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 24 [2024-10-31 22:10:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:28,159 INFO L225 Difference]: With dead ends: 222 [2024-10-31 22:10:28,159 INFO L226 Difference]: Without dead ends: 222 [2024-10-31 22:10:28,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=368, Unknown=3, NotChecked=126, Total=600 [2024-10-31 22:10:28,160 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 16 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:28,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 982 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 482 Invalid, 0 Unknown, 248 Unchecked, 0.6s Time] [2024-10-31 22:10:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-31 22:10:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-10-31 22:10:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 217 states have internal predecessors, (239), 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-10-31 22:10:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2024-10-31 22:10:28,168 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 24 [2024-10-31 22:10:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:28,168 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2024-10-31 22:10:28,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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-10-31 22:10:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2024-10-31 22:10:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:10:28,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:28,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:28,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:10:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-31 22:10:28,372 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-10-31 22:10:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1476739250, now seen corresponding path program 2 times [2024-10-31 22:10:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:28,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673289601] [2024-10-31 22:10:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673289601] [2024-10-31 22:10:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673289601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:10:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50355797] [2024-10-31 22:10:29,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:10:29,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:10:29,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:29,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:10:29,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:10:29,479 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:10:29,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:10:29,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-31 22:10:29,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:29,499 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-10-31 22:10:29,510 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-10-31 22:10:29,549 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-10-31 22:10:29,559 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-10-31 22:10:29,809 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:10:29,809 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-10-31 22:10:29,817 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-10-31 22:10:30,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:10:30,024 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-10-31 22:10:30,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-31 22:10:30,163 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-10-31 22:10:30,173 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-10-31 22:10:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:30,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:10:30,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-10-31 22:10:30,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-10-31 22:10:30,578 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1) v_ArrVal_297) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2024-10-31 22:10:30,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:30,830 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 46 treesize of output 47 [2024-10-31 22:10:30,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:30,838 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 36 treesize of output 37 [2024-10-31 22:10:30,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-10-31 22:10:30,852 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 134 treesize of output 116 [2024-10-31 22:10:30,865 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 28 [2024-10-31 22:10:30,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 13 treesize of output 9 [2024-10-31 22:10:30,876 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 14 treesize of output 10 [2024-10-31 22:10:30,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:30,891 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 89 treesize of output 90 [2024-10-31 22:10:30,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:30,905 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 79 treesize of output 60 [2024-10-31 22:10:30,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:10:30,913 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 92 treesize of output 56 [2024-10-31 22:10:30,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:10:30,924 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-10-31 22:10:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-10-31 22:10:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50355797] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:10:30,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:10:30,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2024-10-31 22:10:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495676745] [2024-10-31 22:10:30,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:10:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-31 22:10:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-31 22:10:30,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=514, Unknown=23, NotChecked=150, Total=812 [2024-10-31 22:10:30,973 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 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-10-31 22:10:31,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_297) c_create_data_~data~0.base) .cse3) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_296) c_create_data_~data~0.base) .cse3)))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_297) c_create_data_~data~0.base) .cse3) .cse1 4)))))) is different from false [2024-10-31 22:10:31,877 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_297 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse1) 4))) (<= 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-10-31 22:10:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:32,780 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2024-10-31 22:10:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:10:32,781 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 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 30 [2024-10-31 22:10:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:32,783 INFO L225 Difference]: With dead ends: 258 [2024-10-31 22:10:32,783 INFO L226 Difference]: Without dead ends: 258 [2024-10-31 22:10:32,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=778, Unknown=29, NotChecked=320, Total=1332 [2024-10-31 22:10:32,785 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 20 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 3 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:32,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1164 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 675 Invalid, 29 Unknown, 417 Unchecked, 1.3s Time] [2024-10-31 22:10:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-31 22:10:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-31 22:10:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.374384236453202) internal successors, (279), 253 states have internal predecessors, (279), 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-10-31 22:10:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2024-10-31 22:10:32,793 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 30 [2024-10-31 22:10:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:32,793 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2024-10-31 22:10:32,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 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-10-31 22:10:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2024-10-31 22:10:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-31 22:10:32,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:32,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 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-10-31 22:10:32,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-31 22:10:32,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-31 22:10:32,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-31 22:10:32,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1663613620, now seen corresponding path program 1 times [2024-10-31 22:10:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:32,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054501685] [2024-10-31 22:10:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:33,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:33,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054501685] [2024-10-31 22:10:33,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054501685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:10:33,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219450812] [2024-10-31 22:10:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:33,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:10:33,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:33,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:10:33,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:10:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:33,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 22:10:33,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:33,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:10:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219450812] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:10:33,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:10:33,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-31 22:10:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976193302] [2024-10-31 22:10:33,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:10:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:10:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:10:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:10:33,459 INFO L87 Difference]: Start difference. First operand 258 states and 283 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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-10-31 22:10:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:10:33,536 INFO L93 Difference]: Finished difference Result 288 states and 313 transitions. [2024-10-31 22:10:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:10:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 43 [2024-10-31 22:10:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:10:33,541 INFO L225 Difference]: With dead ends: 288 [2024-10-31 22:10:33,541 INFO L226 Difference]: Without dead ends: 288 [2024-10-31 22:10:33,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:10:33,543 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 10 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:10:33,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 649 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:10:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-31 22:10:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-31 22:10:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.3261802575107295) internal successors, (309), 283 states have internal predecessors, (309), 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-10-31 22:10:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 313 transitions. [2024-10-31 22:10:33,553 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 313 transitions. Word has length 43 [2024-10-31 22:10:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:10:33,553 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 313 transitions. [2024-10-31 22:10:33,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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-10-31 22:10:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 313 transitions. [2024-10-31 22:10:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-31 22:10:33,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:10:33,558 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:33,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-31 22:10:33,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-31 22:10:33,758 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-10-31 22:10:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2035025446, now seen corresponding path program 3 times [2024-10-31 22:10:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289194724] [2024-10-31 22:10:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289194724] [2024-10-31 22:10:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289194724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:10:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307970313] [2024-10-31 22:10:35,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-31 22:10:35,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:10:35,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:35,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:10:35,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bc4aa27-c929-451f-a792-fc72bc7a041b/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-31 22:10:35,590 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-31 22:10:35,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:10:35,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-31 22:10:35,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:10:35,620 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-10-31 22:10:35,625 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-10-31 22:10:35,629 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-10-31 22:10:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-31 22:10:35,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 22:10:35,896 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:10:35,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:10:35,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:10:36,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:10:36,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:10:36,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:10:36,342 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:10:36,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:10:36,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:10:36,572 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:10:36,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:10:36,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:10:36,867 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-31 22:10:36,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-31 22:10:36,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-31 22:10:37,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-31 22:10:37,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-31 22:10:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:37,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:10:37,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_505) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-10-31 22:10:38,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (< (+ (mod (+ (* 3 .cse0) 3) 4) .cse0) (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4) 12))) (< c_create_data_~counter~0 (div (+ (- 1) (* (- 1) .cse0)) 4)))))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse9 (* c_create_data_~counter~0 4)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_501))) (or (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_500))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_503))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store (store .cse6 .cse7 v_ArrVal_502) .cse8 v_ArrVal_504) c_create_data_~data~0.base) .cse4) .cse9 15) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_505) c_create_data_~data~0.base) .cse4)))))))) (< (+ .cse9 4 (select (select .cse6 c_create_data_~data~0.base) .cse4)) 0))))))) is different from false [2024-10-31 22:10:38,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_501)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 8 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_500))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_503))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ 19 (select (select (store (store .cse1 .cse3 v_ArrVal_502) .cse4 v_ArrVal_504) c_create_data_~data~0.base) .cse2) .cse0) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_505) c_create_data_~data~0.base) .cse2)))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_501))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ (* 3 .cse8) 3) 4) .cse8) (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_500))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (store (store .cse9 .cse10 v_ArrVal_502) (select (select (store .cse11 .cse10 v_ArrVal_503) c_create_data_~data~0.base) .cse2) v_ArrVal_504))) c_create_data_~data~0.base) .cse2) 12)) (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse8)) 4))))))))) is different from false [2024-10-31 22:10:38,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_499))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_498) .cse6 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ 3 (* .cse0 3)) 4)) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_499))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_498) .cse14 v_ArrVal_501))) (or (< (+ (select (select .cse7 c_create_data_~data~0.base) .cse4) .cse8 8) 0) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_500))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_503))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (< (+ 19 .cse8 (select (select (store (store .cse7 .cse9 v_ArrVal_502) .cse10 v_ArrVal_504) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_505) c_create_data_~data~0.base) .cse4)))))))))))))) is different from false [2024-10-31 22:10:38,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse8 v_ArrVal_501)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 8 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_500))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_503))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store (store .cse1 .cse3 v_ArrVal_502) .cse4 v_ArrVal_504) c_create_data_~data~0.base) .cse2) 19 .cse0) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_505) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse15 v_ArrVal_501))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse10)) 4)) (< (+ (mod (+ 3 (* 3 .cse10)) 4) .cse10) (+ (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_500))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (store (store .cse11 .cse12 v_ArrVal_502) (select (select (store .cse13 .cse12 v_ArrVal_503) c_create_data_~data~0.base) .cse2) v_ArrVal_504))) c_create_data_~data~0.base) .cse2) 12))))))))))) is different from false [2024-10-31 22:10:38,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse8 v_ArrVal_501))) (or (let ((.cse6 (store .cse7 .cse8 v_ArrVal_500))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_503))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store (store .cse0 .cse1 v_ArrVal_502) .cse2 v_ArrVal_504) c_create_data_~data~0.base) .cse3) 23 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_505) c_create_data_~data~0.base) .cse3))))))) (< (+ .cse4 (select (select .cse0 c_create_data_~data~0.base) .cse3) 12) 0)))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_499))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_498) .cse15 v_ArrVal_501))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse10)) 4)) (< (+ (mod (+ 3 (* 3 .cse10)) 4) .cse10) (+ (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_500))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (store (store .cse11 .cse12 v_ArrVal_502) (select (select (store .cse13 .cse12 v_ArrVal_503) c_create_data_~data~0.base) .cse3) v_ArrVal_504))) c_create_data_~data~0.base) .cse3) 12))))))))))) is different from false [2024-10-31 22:10:39,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_497))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_499))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_496) .cse7 v_ArrVal_498) .cse6 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4) 12)))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_497))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_499))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_496) .cse17 v_ArrVal_498) .cse16 v_ArrVal_501)) (.cse12 (* c_create_data_~counter~0 4))) (or (let ((.cse14 (store .cse15 .cse16 v_ArrVal_500))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_503))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store (store .cse9 .cse10 v_ArrVal_502) .cse11 v_ArrVal_504) c_create_data_~data~0.base) .cse4) 23 .cse12) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_505) c_create_data_~data~0.base) .cse4))))))) (< (+ (select (select .cse9 c_create_data_~data~0.base) .cse4) .cse12 12) 0)))))))))) is different from false [2024-10-31 22:10:39,241 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_497))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse9 .cse8 v_ArrVal_499))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_496) .cse8 v_ArrVal_498) .cse6 v_ArrVal_501))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_500))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_502) (select (select (store .cse3 .cse2 v_ArrVal_503) c_create_data_~data~0.base) .cse4) v_ArrVal_504))) c_create_data_~data~0.base) .cse4))) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_497))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_499))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (* c_create_data_~counter~0 4)) (.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_496) .cse18 v_ArrVal_498) .cse17 v_ArrVal_501))) (or (< (+ (select (select .cse10 c_create_data_~data~0.base) .cse4) .cse11 12) 0) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_500))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_503))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (< (+ 23 .cse11 (select (select (store (store .cse10 .cse12 v_ArrVal_502) .cse13 v_ArrVal_504) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_505) c_create_data_~data~0.base) .cse4))))))))))))))))) is different from false [2024-10-31 22:10:40,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:40,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 796 treesize of output 786 [2024-10-31 22:10:40,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:10:40,236 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 776 treesize of output 446 [2024-10-31 22:10:41,581 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 124914397 treesize of output 106879369