./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:12:55,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:12:55,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:12:55,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:12:55,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:12:55,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:12:55,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:12:55,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:12:55,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:12:55,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:12:55,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:12:55,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:12:55,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:12:55,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:12:55,754 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:12:55,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:12:55,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:12:55,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:12:55,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:12:55,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:12:55,756 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:12:55,759 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:12:55,759 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:12:55,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:12:55,760 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:12:55,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:12:55,760 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:12:55,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:12:55,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:12:55,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:12:55,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:12:55,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:12:55,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:12:55,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:12:55,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:12:55,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:12:55,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:12:55,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:12:55,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:12:55,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:12:55,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:12:55,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:12:55,766 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2024-11-10 15:12:56,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:12:56,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:12:56,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:12:56,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:12:56,088 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:12:56,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-10 15:12:57,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:12:57,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:12:57,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-10 15:12:57,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ace14b83/edd090b2845c4782b48be4657a37f498/FLAG67ad7dedb [2024-11-10 15:12:58,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ace14b83/edd090b2845c4782b48be4657a37f498 [2024-11-10 15:12:58,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:12:58,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:12:58,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:12:58,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:12:58,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:12:58,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664205b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58, skipping insertion in model container [2024-11-10 15:12:58,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:12:58,443 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:12:58,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:12:58,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:12:58,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:12:58,566 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:12:58,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58 WrapperNode [2024-11-10 15:12:58,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:12:58,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:12:58,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:12:58,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:12:58,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,624 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-10 15:12:58,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:12:58,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:12:58,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:12:58,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:12:58,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,694 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-11-10 15:12:58,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:12:58,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:12:58,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:12:58,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:12:58,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (1/1) ... [2024-11-10 15:12:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:12:58,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:58,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:12:58,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:12:58,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:12:58,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:12:58,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:12:58,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:12:58,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:12:58,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-10 15:12:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-10 15:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:12:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:12:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:12:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:12:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:12:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:12:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:12:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:12:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:12:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:12:59,022 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:12:59,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:12:59,345 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2024-11-10 15:12:59,541 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2024-11-10 15:12:59,582 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-10 15:12:59,583 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:12:59,605 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:12:59,605 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:12:59,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:12:59 BoogieIcfgContainer [2024-11-10 15:12:59,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:12:59,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:12:59,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:12:59,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:12:59,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:12:58" (1/3) ... [2024-11-10 15:12:59,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1231f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:12:59, skipping insertion in model container [2024-11-10 15:12:59,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:12:58" (2/3) ... [2024-11-10 15:12:59,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1231f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:12:59, skipping insertion in model container [2024-11-10 15:12:59,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:12:59" (3/3) ... [2024-11-10 15:12:59,616 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-10 15:12:59,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:12:59,634 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-10 15:12:59,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:12:59,701 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;@2741eb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:12:59,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-10 15:12:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 105 states have (on average 2.0285714285714285) internal successors, (213), 197 states have internal predecessors, (213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:12:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:12:59,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:59,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:12:59,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:12:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 7571806, now seen corresponding path program 1 times [2024-11-10 15:12:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:59,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088988834] [2024-11-10 15:12:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:59,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:12:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:59,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088988834] [2024-11-10 15:12:59,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088988834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:12:59,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:12:59,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:13:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779435753] [2024-11-10 15:13:00,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:00,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:00,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:00,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:00,037 INFO L87 Difference]: Start difference. First operand has 201 states, 105 states have (on average 2.0285714285714285) internal successors, (213), 197 states have internal predecessors, (213), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:00,311 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-11-10 15:13:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:13:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:13:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:00,323 INFO L225 Difference]: With dead ends: 195 [2024-11-10 15:13:00,323 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 15:13:00,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:00,330 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 79 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:00,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 329 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:13:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 15:13:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-10 15:13:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.941747572815534) internal successors, (200), 188 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2024-11-10 15:13:00,385 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 4 [2024-11-10 15:13:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2024-11-10 15:13:00,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2024-11-10 15:13:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:13:00,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:00,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:13:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:13:00,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 7571807, now seen corresponding path program 1 times [2024-11-10 15:13:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499160822] [2024-11-10 15:13:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499160822] [2024-11-10 15:13:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499160822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:00,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:13:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062813690] [2024-11-10 15:13:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:00,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:00,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:00,651 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:00,990 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2024-11-10 15:13:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:13:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:13:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:00,994 INFO L225 Difference]: With dead ends: 208 [2024-11-10 15:13:00,997 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 15:13:00,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:00,999 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 28 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:00,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 373 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:13:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 15:13:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2024-11-10 15:13:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 108 states have (on average 1.9166666666666667) internal successors, (207), 193 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-11-10 15:13:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2024-11-10 15:13:01,027 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 4 [2024-11-10 15:13:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:01,028 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2024-11-10 15:13:01,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2024-11-10 15:13:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:13:01,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:01,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:13:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:13:01,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:01,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash 234726163, now seen corresponding path program 1 times [2024-11-10 15:13:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861495966] [2024-11-10 15:13:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861495966] [2024-11-10 15:13:01,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861495966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360271990] [2024-11-10 15:13:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:01,103 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:01,230 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-10 15:13:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:13:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:01,234 INFO L225 Difference]: With dead ends: 195 [2024-11-10 15:13:01,234 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 15:13:01,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:01,236 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:01,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 15:13:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-10 15:13:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 191 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2024-11-10 15:13:01,255 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 5 [2024-11-10 15:13:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:01,256 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2024-11-10 15:13:01,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2024-11-10 15:13:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:13:01,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:01,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:13:01,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:13:01,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:01,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash 234726164, now seen corresponding path program 1 times [2024-11-10 15:13:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:01,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153590805] [2024-11-10 15:13:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:01,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:01,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153590805] [2024-11-10 15:13:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153590805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358459752] [2024-11-10 15:13:01,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:01,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:01,314 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:01,430 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-10 15:13:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:13:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:01,431 INFO L225 Difference]: With dead ends: 193 [2024-11-10 15:13:01,431 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 15:13:01,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:01,433 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:01,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 15:13:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-10 15:13:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 108 states have (on average 1.8611111111111112) 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-11-10 15:13:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2024-11-10 15:13:01,440 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 5 [2024-11-10 15:13:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:01,441 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2024-11-10 15:13:01,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2024-11-10 15:13:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:13:01,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:01,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:01,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:13:01,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:01,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2021505145, now seen corresponding path program 1 times [2024-11-10 15:13:01,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:01,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88070252] [2024-11-10 15:13:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88070252] [2024-11-10 15:13:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88070252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:13:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680073149] [2024-11-10 15:13:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:01,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:13:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:13:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:01,584 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:01,681 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2024-11-10 15:13:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:01,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:13:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:01,683 INFO L225 Difference]: With dead ends: 202 [2024-11-10 15:13:01,683 INFO L226 Difference]: Without dead ends: 202 [2024-11-10 15:13:01,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:13:01,684 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 18 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:01,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 742 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-10 15:13:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-10 15:13:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.853211009174312) internal successors, (202), 190 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-11-10 15:13:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2024-11-10 15:13:01,700 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 10 [2024-11-10 15:13:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:01,700 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2024-11-10 15:13:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2024-11-10 15:13:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:13:01,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:01,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:01,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:13:01,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:01,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1330615282, now seen corresponding path program 1 times [2024-11-10 15:13:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303000318] [2024-11-10 15:13:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:01,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303000318] [2024-11-10 15:13:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303000318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:01,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:13:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595430795] [2024-11-10 15:13:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:01,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:01,802 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:01,838 INFO L93 Difference]: Finished difference Result 275 states and 291 transitions. [2024-11-10 15:13:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 15:13:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:01,840 INFO L225 Difference]: With dead ends: 275 [2024-11-10 15:13:01,841 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 15:13:01,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:01,843 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 85 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:01,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 584 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:13:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 15:13:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 239. [2024-11-10 15:13:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.8758169934640523) internal successors, (287), 234 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 291 transitions. [2024-11-10 15:13:01,856 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 291 transitions. Word has length 12 [2024-11-10 15:13:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:01,865 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 291 transitions. [2024-11-10 15:13:01,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 291 transitions. [2024-11-10 15:13:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:13:01,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:01,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:01,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:13:01,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1178938707, now seen corresponding path program 1 times [2024-11-10 15:13:01,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:01,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071640661] [2024-11-10 15:13:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071640661] [2024-11-10 15:13:02,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071640661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:02,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:02,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:02,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355136864] [2024-11-10 15:13:02,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:02,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:02,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:02,007 INFO L87 Difference]: Start difference. First operand 239 states and 291 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:02,138 INFO L93 Difference]: Finished difference Result 224 states and 261 transitions. [2024-11-10 15:13:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-10 15:13:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:02,140 INFO L225 Difference]: With dead ends: 224 [2024-11-10 15:13:02,140 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 15:13:02,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:02,141 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:02,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 220 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 15:13:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-10 15:13:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 153 states have (on average 1.6797385620915033) internal successors, (257), 219 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 261 transitions. [2024-11-10 15:13:02,149 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 261 transitions. Word has length 14 [2024-11-10 15:13:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:02,150 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 261 transitions. [2024-11-10 15:13:02,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 261 transitions. [2024-11-10 15:13:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:13:02,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:02,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:13:02,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:02,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1178938708, now seen corresponding path program 1 times [2024-11-10 15:13:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549745475] [2024-11-10 15:13:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:02,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549745475] [2024-11-10 15:13:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549745475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:02,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028249569] [2024-11-10 15:13:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:02,227 INFO L87 Difference]: Start difference. First operand 224 states and 261 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:02,335 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2024-11-10 15:13:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-10 15:13:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:02,337 INFO L225 Difference]: With dead ends: 209 [2024-11-10 15:13:02,337 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 15:13:02,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:02,338 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:02,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 215 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 15:13:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 15:13:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.4836601307189543) internal successors, (227), 204 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-11-10 15:13:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2024-11-10 15:13:02,342 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 14 [2024-11-10 15:13:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:02,343 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2024-11-10 15:13:02,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2024-11-10 15:13:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:13:02,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:02,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:02,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:13:02,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1069046813, now seen corresponding path program 1 times [2024-11-10 15:13:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48851025] [2024-11-10 15:13:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48851025] [2024-11-10 15:13:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48851025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:02,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:02,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:13:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025303987] [2024-11-10 15:13:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:13:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:13:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:02,466 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:02,668 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2024-11-10 15:13:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 20 [2024-11-10 15:13:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:02,672 INFO L225 Difference]: With dead ends: 264 [2024-11-10 15:13:02,672 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 15:13:02,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:13:02,673 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:02,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 432 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:13:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 15:13:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 219. [2024-11-10 15:13:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 163 states have (on average 1.478527607361963) internal successors, (241), 214 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2024-11-10 15:13:02,680 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 20 [2024-11-10 15:13:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:02,681 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2024-11-10 15:13:02,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2024-11-10 15:13:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:13:02,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:02,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:02,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:13:02,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:02,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1069046812, now seen corresponding path program 1 times [2024-11-10 15:13:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198039584] [2024-11-10 15:13:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198039584] [2024-11-10 15:13:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198039584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:02,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:02,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:13:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135534935] [2024-11-10 15:13:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:02,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:13:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:02,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:13:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:13:02,922 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:03,158 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2024-11-10 15:13:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:13:03,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 20 [2024-11-10 15:13:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:03,160 INFO L225 Difference]: With dead ends: 219 [2024-11-10 15:13:03,161 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 15:13:03,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:13:03,162 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 2 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:03,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:13:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 15:13:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-10 15:13:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 214 states have internal predecessors, (237), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2024-11-10 15:13:03,168 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 20 [2024-11-10 15:13:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:03,168 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2024-11-10 15:13:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2024-11-10 15:13:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:13:03,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:03,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:03,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:13:03,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:03,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash -315602842, now seen corresponding path program 1 times [2024-11-10 15:13:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85648499] [2024-11-10 15:13:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85648499] [2024-11-10 15:13:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85648499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222485870] [2024-11-10 15:13:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:03,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:03,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:13:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:03,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:13:03,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:03,591 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:13:03,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:13:03,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:03,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:03,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:13:03,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:13:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:13:03,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:03,884 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_160 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse0) v_ArrVal_160) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2024-11-10 15:13:03,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:03,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-10 15:13:03,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-10 15:13:03,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-10 15:13:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-10 15:13:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222485870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:03,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-10 15:13:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160215128] [2024-11-10 15:13:03,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:13:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:13:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2024-11-10 15:13:03,948 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:04,347 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2024-11-10 15:13:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 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 26 [2024-11-10 15:13:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:04,349 INFO L225 Difference]: With dead ends: 220 [2024-11-10 15:13:04,349 INFO L226 Difference]: Without dead ends: 220 [2024-11-10 15:13:04,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 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-11-10 15:13:04,350 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 22 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:04,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 824 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 521 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2024-11-10 15:13:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-10 15:13:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2024-11-10 15:13:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.4417177914110428) internal successors, (235), 213 states have internal predecessors, (235), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2024-11-10 15:13:04,355 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 26 [2024-11-10 15:13:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:04,356 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2024-11-10 15:13:04,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2024-11-10 15:13:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:13:04,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:04,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:04,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:13:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 15:13:04,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:04,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash -315602841, now seen corresponding path program 1 times [2024-11-10 15:13:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599782782] [2024-11-10 15:13:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:04,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599782782] [2024-11-10 15:13:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599782782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644383327] [2024-11-10 15:13:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:04,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:04,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:04,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:13:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:05,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:13:05,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:05,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:13:05,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-10 15:13:05,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:13:05,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:13:05,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:05,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:05,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:05,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:05,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:13:05,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:13:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:05,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:05,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_219 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_218) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-10 15:13:05,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:05,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-10 15:13:05,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:05,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-10 15:13:05,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-10 15:13:05,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-10 15:13:05,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 15:13:05,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:13:05,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:05,519 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 24 treesize of output 25 [2024-11-10 15:13:05,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:13:05,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 15:13:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644383327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:05,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2024-11-10 15:13:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293338955] [2024-11-10 15:13:05,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:05,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:13:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:13:05,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=231, Unknown=14, NotChecked=32, Total=342 [2024-11-10 15:13:05,549 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 19 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:06,203 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2024-11-10 15:13:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:13:06,203 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 19 states have internal predecessors, (48), 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 26 [2024-11-10 15:13:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:06,205 INFO L225 Difference]: With dead ends: 242 [2024-11-10 15:13:06,205 INFO L226 Difference]: Without dead ends: 242 [2024-11-10 15:13:06,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=313, Unknown=16, NotChecked=38, Total=462 [2024-11-10 15:13:06,206 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 12 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:06,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1125 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 16 Unknown, 89 Unchecked, 0.6s Time] [2024-11-10 15:13:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-10 15:13:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-10 15:13:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 187 states have (on average 1.3957219251336899) internal successors, (261), 237 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2024-11-10 15:13:06,210 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 26 [2024-11-10 15:13:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:06,210 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2024-11-10 15:13:06,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 19 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2024-11-10 15:13:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:13:06,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:06,212 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:06,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:13:06,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 15:13:06,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:06,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1778202285, now seen corresponding path program 2 times [2024-11-10 15:13:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:06,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034797341] [2024-11-10 15:13:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034797341] [2024-11-10 15:13:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034797341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179455849] [2024-11-10 15:13:07,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:13:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:07,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:07,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:13:07,183 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:13:07,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:13:07,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 15:13:07,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:07,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:13:07,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-10 15:13:07,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:13:07,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:07,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:07,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:07,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:07,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:07,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:07,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:07,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:07,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:07,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:13:07,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:13:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:07,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:07,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-10 15:13:07,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-10 15:13:07,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))))) is different from false [2024-11-10 15:13:08,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse1 v_ArrVal_304) .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse6 v_ArrVal_304) (select (select (store .cse7 .cse6 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306))) c_create_data_~data~0.base) .cse3)))))) is different from false [2024-11-10 15:13:08,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse1 v_ArrVal_304) (select (select (store .cse2 .cse1 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306))) c_create_data_~data~0.base) .cse3) 12))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_303))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse4 v_ArrVal_304) .cse5 v_ArrVal_306) c_create_data_~data~0.base) .cse3) 16) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_305) c_create_data_~data~0.base) .cse3))))))))))) is different from false [2024-11-10 15:13:08,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-10 15:13:08,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:08,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-10 15:13:08,389 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 12906 treesize of output 11280 [2024-11-10 15:13:08,462 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 6179 treesize of output 6017 [2024-11-10 15:13:08,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 240 [2024-11-10 15:13:08,489 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 240 treesize of output 224 [2024-11-10 15:13:08,493 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 224 treesize of output 212 [2024-11-10 15:13:08,496 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 212 treesize of output 172 [2024-11-10 15:13:08,502 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 136 treesize of output 132 [2024-11-10 15:13:08,509 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 168 treesize of output 156 [2024-11-10 15:13:08,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:08,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2024-11-10 15:13:08,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:08,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-10 15:13:08,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:13:08,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 55 [2024-11-10 15:13:08,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:13:08,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 15:13:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 3 times theorem prover too weak. 0 trivial. 21 not checked. [2024-11-10 15:13:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179455849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:08,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2024-11-10 15:13:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662945217] [2024-11-10 15:13:08,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 15:13:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 15:13:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=749, Unknown=24, NotChecked=310, Total=1260 [2024-11-10 15:13:08,605 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 36 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:09,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse15 (+ .cse11 .cse2 4)) (.cse12 (select |c_#length| .cse0))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 12))) (not (= c_create_data_~data~0.base .cse0)) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_303))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_304) .cse3 v_ArrVal_306) c_create_data_~data~0.base) .cse1) 16 .cse2) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_303))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_304) .cse5 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_303))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse1))) (<= (+ 16 .cse2 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse7 v_ArrVal_304) .cse8 v_ArrVal_306) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))))) (<= (+ .cse11 .cse2 8) .cse12) (= .cse11 0) (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ .cse2 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ .cse2 12 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse13 v_ArrVal_304) (select (select (store .cse14 .cse13 v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306))) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse11 .cse2)) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ .cse2 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306) c_create_data_~data~0.base) .cse1)))) (<= 0 .cse15) (<= .cse15 .cse12) (= .cse12 80) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse2 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (<= (+ .cse2 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) .cse16 v_ArrVal_306) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse2)) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse1))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_303))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse18 v_ArrVal_304) .cse19 v_ArrVal_306) c_create_data_~data~0.base) .cse1) 16 .cse2) (select |c_#length| (select (select (store .cse20 .cse19 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse22 (select (select .cse23 c_create_data_~data~0.base) .cse1))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse22 v_ArrVal_304) (select (select (store .cse23 .cse22 v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306))) c_create_data_~data~0.base) .cse1) .cse2 12))) (<= (+ |c_create_data_#t~mem8.offset| .cse2 4) (select |c_#length| |c_create_data_#t~mem8.base|)))))) is different from false [2024-11-10 15:13:09,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse1 v_ArrVal_304) .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse6 v_ArrVal_304) (select (select (store .cse7 .cse6 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306))) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) .cse8 v_ArrVal_306) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_305) c_create_data_~data~0.base) .cse3)))))) (<= 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-11-10 15:13:09,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_303))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_304) .cse3 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse5 .cse2)) (<= (+ .cse5 .cse2 4) (select |c_#length| .cse0))))) is different from false [2024-11-10 15:13:09,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0))))) is different from false [2024-11-10 15:13:09,999 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_306 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (<= 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-11-10 15:13:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:10,802 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2024-11-10 15:13:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:13:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 36 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-10 15:13:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:10,804 INFO L225 Difference]: With dead ends: 302 [2024-11-10 15:13:10,804 INFO L226 Difference]: Without dead ends: 302 [2024-11-10 15:13:10,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=338, Invalid=1265, Unknown=77, NotChecked=870, Total=2550 [2024-11-10 15:13:10,806 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 36 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 12 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 918 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:10,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1938 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1129 Invalid, 21 Unknown, 918 Unchecked, 1.2s Time] [2024-11-10 15:13:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-10 15:13:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-10 15:13:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 247 states have (on average 1.3157894736842106) internal successors, (325), 297 states have internal predecessors, (325), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 329 transitions. [2024-11-10 15:13:10,812 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 329 transitions. Word has length 38 [2024-11-10 15:13:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:10,813 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 329 transitions. [2024-11-10 15:13:10,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 36 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 329 transitions. [2024-11-10 15:13:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:13:10,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:10,814 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:10,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:13:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:11,019 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash -53434397, now seen corresponding path program 1 times [2024-11-10 15:13:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:11,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945786329] [2024-11-10 15:13:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-10 15:13:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:11,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945786329] [2024-11-10 15:13:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945786329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292189706] [2024-11-10 15:13:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:11,109 INFO L87 Difference]: Start difference. First operand 302 states and 329 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:11,201 INFO L93 Difference]: Finished difference Result 300 states and 325 transitions. [2024-11-10 15:13:11,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:11,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 57 [2024-11-10 15:13:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:11,204 INFO L225 Difference]: With dead ends: 300 [2024-11-10 15:13:11,204 INFO L226 Difference]: Without dead ends: 300 [2024-11-10 15:13:11,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:11,204 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:11,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-10 15:13:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-11-10 15:13:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 247 states have (on average 1.2995951417004048) internal successors, (321), 295 states have internal predecessors, (321), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 325 transitions. [2024-11-10 15:13:11,211 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 325 transitions. Word has length 57 [2024-11-10 15:13:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:11,211 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 325 transitions. [2024-11-10 15:13:11,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 325 transitions. [2024-11-10 15:13:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:13:11,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:11,214 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:13:11,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash -53434396, now seen corresponding path program 1 times [2024-11-10 15:13:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439548931] [2024-11-10 15:13:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:11,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439548931] [2024-11-10 15:13:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439548931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265607622] [2024-11-10 15:13:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:11,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:11,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:11,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:13:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:11,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:13:11,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:11,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265607622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:11,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:11,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 15:13:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068845790] [2024-11-10 15:13:11,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:11,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:13:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:13:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:13:11,655 INFO L87 Difference]: Start difference. First operand 300 states and 325 transitions. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:11,727 INFO L93 Difference]: Finished difference Result 342 states and 367 transitions. [2024-11-10 15:13:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:13:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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 57 [2024-11-10 15:13:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:11,730 INFO L225 Difference]: With dead ends: 342 [2024-11-10 15:13:11,730 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 15:13:11,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:13:11,732 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 8 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:11,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 674 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 15:13:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-10 15:13:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 337 states have internal predecessors, (363), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 367 transitions. [2024-11-10 15:13:11,740 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 367 transitions. Word has length 57 [2024-11-10 15:13:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:11,741 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 367 transitions. [2024-11-10 15:13:11,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 367 transitions. [2024-11-10 15:13:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 15:13:11,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:11,743 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:11,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:13:11,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 15:13:11,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:11,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -929548036, now seen corresponding path program 3 times [2024-11-10 15:13:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750767059] [2024-11-10 15:13:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750767059] [2024-11-10 15:13:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750767059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476441332] [2024-11-10 15:13:13,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:13:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:13,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:13,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:13:14,406 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-10 15:13:14,406 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:13:14,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-10 15:13:14,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:13:14,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:13:14,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-10 15:13:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:13:14,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:13:14,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:14,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:14,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:14,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:14,742 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:14,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:14,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:14,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:14,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:15,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:15,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:15,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:15,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:15,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:15,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:15,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:15,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:15,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:15,418 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:15,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:15,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:15,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:15,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:15,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:15,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:13:15,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:13:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:15,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:15,837 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_637 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_637) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_637) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_636) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-10 15:13:15,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_637) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_636) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_637 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_637) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-11-10 15:13:15,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_637) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_636) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_637 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_637) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-10 15:13:15,888 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_634))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_635) .cse1 v_ArrVal_637) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_636) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_635) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_634) c_create_data_~data~0.base) .cse2) v_ArrVal_637) c_create_data_~data~0.base) .cse2)))))) is different from false [2024-11-10 15:13:15,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_634))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_635) .cse1 v_ArrVal_637) c_create_data_~data~0.base) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_636) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_635) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_634) c_create_data_~data~0.base) .cse2) v_ArrVal_637) c_create_data_~data~0.base) .cse2) .cse3 8)))))) is different from false [2024-11-10 15:13:15,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_635) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_634) c_create_data_~data~0.base) .cse1) v_ArrVal_637) c_create_data_~data~0.base) .cse1) .cse2 12))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_634))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_635) .cse3 v_ArrVal_637) c_create_data_~data~0.base) .cse1) 16 .cse2) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_636) c_create_data_~data~0.base) .cse1))))))))) is different from false [2024-11-10 15:13:15,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_633))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_632) .cse0 v_ArrVal_635) (select (select (store .cse1 .cse0 v_ArrVal_634) c_create_data_~data~0.base) .cse2) v_ArrVal_637))) c_create_data_~data~0.base) .cse2) .cse3 12))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_633))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_634))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_632) .cse4 v_ArrVal_635) .cse5 v_ArrVal_637) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_636) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2024-11-10 15:13:16,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_633))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_634))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_632) .cse1 v_ArrVal_635) .cse2 v_ArrVal_637) c_create_data_~data~0.base) .cse3) 16 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_636) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_633))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_632) .cse7 v_ArrVal_635) (select (select (store .cse8 .cse7 v_ArrVal_634) c_create_data_~data~0.base) .cse3) v_ArrVal_637))) c_create_data_~data~0.base) .cse3) .cse4 12)))))) is different from false [2024-11-10 15:13:16,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_633))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_632) .cse1 v_ArrVal_635) (select (select (store .cse2 .cse1 v_ArrVal_634) c_create_data_~data~0.base) .cse3) v_ArrVal_637))) c_create_data_~data~0.base) .cse3) 16 .cse4))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_633))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_634))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_632) .cse5 v_ArrVal_635) .cse6 v_ArrVal_637) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_636) c_create_data_~data~0.base) .cse3))))))))))) is different from false [2024-11-10 15:13:16,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_630))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_633))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_631) .cse0 v_ArrVal_632) .cse1 v_ArrVal_635) (select (select (store .cse2 .cse1 v_ArrVal_634) c_create_data_~data~0.base) .cse3) v_ArrVal_637))))) c_create_data_~data~0.base) .cse3) 16 .cse5))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_630))) (let ((.cse6 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_633))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_634))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_631) .cse6 v_ArrVal_632) .cse7 v_ArrVal_635) .cse8 v_ArrVal_637) c_create_data_~data~0.base) .cse3) .cse5 20) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_636) c_create_data_~data~0.base) .cse3)))))))))))) is different from false [2024-11-10 15:13:16,109 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_630))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_633))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_634))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_631) .cse2 v_ArrVal_632) .cse3 v_ArrVal_635) .cse4 v_ArrVal_637) c_create_data_~data~0.base) .cse5) 20) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_636) c_create_data_~data~0.base) .cse5)))))))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_630))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_633))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_631) .cse9 v_ArrVal_632) .cse10 v_ArrVal_635) (select (select (store .cse11 .cse10 v_ArrVal_634) c_create_data_~data~0.base) .cse5) v_ArrVal_637))))) c_create_data_~data~0.base) .cse5))))))) is different from false [2024-11-10 15:13:16,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_629))) (let ((.cse0 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_630))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_633))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_634))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_628) .cse0 v_ArrVal_631) .cse1 v_ArrVal_632) .cse2 v_ArrVal_635) .cse3 v_ArrVal_637) c_create_data_~data~0.base) .cse4) .cse5 24) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_636) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_629))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_630))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_633))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_628) .cse10 v_ArrVal_631) .cse11 v_ArrVal_632) .cse12 v_ArrVal_635) (select (select (store .cse13 .cse12 v_ArrVal_634) c_create_data_~data~0.base) .cse4) v_ArrVal_637))))))) c_create_data_~data~0.base) .cse4) .cse5 20))))) is different from false [2024-11-10 15:13:16,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_629))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_630))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_633))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_628) .cse2 v_ArrVal_631) .cse3 v_ArrVal_632) .cse4 v_ArrVal_635) (select (select (store .cse5 .cse4 v_ArrVal_634) c_create_data_~data~0.base) .cse6) v_ArrVal_637))))))) c_create_data_~data~0.base) .cse6) 20))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_629))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_630))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_633))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_634))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_628) .cse9 v_ArrVal_631) .cse10 v_ArrVal_632) .cse11 v_ArrVal_635) .cse12 v_ArrVal_637) c_create_data_~data~0.base) .cse6) 24) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_636) c_create_data_~data~0.base) .cse6))))))))))))))) is different from false [2024-11-10 15:13:16,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_629))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_630))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_633))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_628) .cse2 v_ArrVal_631) .cse3 v_ArrVal_632) .cse4 v_ArrVal_635) (select (select (store .cse5 .cse4 v_ArrVal_634) c_create_data_~data~0.base) .cse6) v_ArrVal_637))))))) c_create_data_~data~0.base) .cse6) 24))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_629))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_630))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_633))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_634))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_628) .cse9 v_ArrVal_631) .cse10 v_ArrVal_632) .cse11 v_ArrVal_635) .cse12 v_ArrVal_637) c_create_data_~data~0.base) .cse6) 28) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_636) c_create_data_~data~0.base) .cse6))))))))))))))) is different from false [2024-11-10 15:13:20,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse6 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_626))) (let ((.cse1 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_629))) (let ((.cse2 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_630))) (let ((.cse3 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_633))) (let ((.cse4 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_634))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (<= (+ .cse0 28 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_627) .cse1 v_ArrVal_628) .cse2 v_ArrVal_631) .cse3 v_ArrVal_632) .cse4 v_ArrVal_635) .cse5 v_ArrVal_637) c_create_data_~data~0.base) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_636) c_create_data_~data~0.base) .cse6)))))))))))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_626))) (let ((.cse12 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_629))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_630))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_633))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_627) .cse12 v_ArrVal_628) .cse13 v_ArrVal_631) .cse14 v_ArrVal_632) .cse15 v_ArrVal_635) (select (select (store .cse16 .cse15 v_ArrVal_634) c_create_data_~data~0.base) .cse6) v_ArrVal_637))))))))) c_create_data_~data~0.base) .cse6) 24))))) is different from false [2024-11-10 15:13:25,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_626))) (let ((.cse2 (select (select .cse12 c_create_data_~data~0.base) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_629))) (let ((.cse3 (select (select .cse11 c_create_data_~data~0.base) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_630))) (let ((.cse4 (select (select .cse10 c_create_data_~data~0.base) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_633))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_634))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (<= (+ .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_627) .cse2 v_ArrVal_628) .cse3 v_ArrVal_631) .cse4 v_ArrVal_632) .cse5 v_ArrVal_635) .cse6 v_ArrVal_637) c_create_data_~data~0.base) .cse7) 28) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_636) c_create_data_~data~0.base) .cse7)))))))))))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_626))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_629))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_630))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_633))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_627) .cse13 v_ArrVal_628) .cse14 v_ArrVal_631) .cse15 v_ArrVal_632) .cse16 v_ArrVal_635) (select (select (store .cse17 .cse16 v_ArrVal_634) c_create_data_~data~0.base) .cse7) v_ArrVal_637))))))))) c_create_data_~data~0.base) .cse7) 24)))))) is different from false [2024-11-10 15:13:25,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_626))) (let ((.cse2 (select (select .cse12 c_create_data_~data~0.base) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_629))) (let ((.cse3 (select (select .cse11 c_create_data_~data~0.base) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_630))) (let ((.cse4 (select (select .cse10 c_create_data_~data~0.base) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_633))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_634))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_627) .cse2 v_ArrVal_628) .cse3 v_ArrVal_631) .cse4 v_ArrVal_632) .cse5 v_ArrVal_635) .cse6 v_ArrVal_637) c_create_data_~data~0.base) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_636) c_create_data_~data~0.base) .cse7)))))))))))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_626))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_629))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_630))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_633))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_627) .cse13 v_ArrVal_628) .cse14 v_ArrVal_631) .cse15 v_ArrVal_632) .cse16 v_ArrVal_635) (select (select (store .cse17 .cse16 v_ArrVal_634) c_create_data_~data~0.base) .cse7) v_ArrVal_637))))))))) c_create_data_~data~0.base) .cse7) 28)))))) is different from false [2024-11-10 15:13:30,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4)) (.cse7 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_625))) (let ((.cse0 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse0 v_ArrVal_626))) (let ((.cse1 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse1 v_ArrVal_629))) (let ((.cse2 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse2 v_ArrVal_630))) (let ((.cse3 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse3 v_ArrVal_633))) (let ((.cse4 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse4 v_ArrVal_634))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (<= (+ 32 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_624) .cse0 v_ArrVal_627) .cse1 v_ArrVal_628) .cse2 v_ArrVal_631) .cse3 v_ArrVal_632) .cse4 v_ArrVal_635) .cse5 v_ArrVal_637) c_create_data_~data~0.base) .cse6) .cse7) (select |c_#length| (select (select (store .cse8 .cse5 v_ArrVal_636) c_create_data_~data~0.base) .cse6)))))))))))))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_625))) (let ((.cse14 (select (select .cse23 c_create_data_~data~0.base) .cse6))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_626))) (let ((.cse15 (select (select .cse22 c_create_data_~data~0.base) .cse6))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_629))) (let ((.cse16 (select (select .cse21 c_create_data_~data~0.base) .cse6))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_630))) (let ((.cse17 (select (select .cse20 c_create_data_~data~0.base) .cse6))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_633))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_624) .cse14 v_ArrVal_627) .cse15 v_ArrVal_628) .cse16 v_ArrVal_631) .cse17 v_ArrVal_632) .cse18 v_ArrVal_635) (select (select (store .cse19 .cse18 v_ArrVal_634) c_create_data_~data~0.base) .cse6) v_ArrVal_637))))))))))) c_create_data_~data~0.base) .cse6) .cse7 28))))) is different from false [2024-11-10 15:13:35,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse8))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_625))) (let ((.cse2 (select (select .cse14 c_create_data_~data~0.base) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_626))) (let ((.cse3 (select (select .cse13 c_create_data_~data~0.base) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_629))) (let ((.cse4 (select (select .cse12 c_create_data_~data~0.base) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_630))) (let ((.cse5 (select (select .cse11 c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_633))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_634))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_624) .cse2 v_ArrVal_627) .cse3 v_ArrVal_628) .cse4 v_ArrVal_631) .cse5 v_ArrVal_632) .cse6 v_ArrVal_635) .cse7 v_ArrVal_637) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_636) c_create_data_~data~0.base) .cse8)))))))))))))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= 0 (+ .cse0 28 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_625))) (let ((.cse15 (select (select .cse24 c_create_data_~data~0.base) .cse8))) (let ((.cse23 (store .cse24 .cse15 v_ArrVal_626))) (let ((.cse16 (select (select .cse23 c_create_data_~data~0.base) .cse8))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_629))) (let ((.cse17 (select (select .cse22 c_create_data_~data~0.base) .cse8))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_630))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse8))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_633))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_624) .cse15 v_ArrVal_627) .cse16 v_ArrVal_628) .cse17 v_ArrVal_631) .cse18 v_ArrVal_632) .cse19 v_ArrVal_635) (select (select (store .cse20 .cse19 v_ArrVal_634) c_create_data_~data~0.base) .cse8) v_ArrVal_637))))))))))) c_create_data_~data~0.base) .cse8))))))) is different from false [2024-11-10 15:13:39,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse8))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_625))) (let ((.cse2 (select (select .cse14 c_create_data_~data~0.base) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_626))) (let ((.cse3 (select (select .cse13 c_create_data_~data~0.base) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_629))) (let ((.cse4 (select (select .cse12 c_create_data_~data~0.base) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_630))) (let ((.cse5 (select (select .cse11 c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_633))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_634))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (<= (+ .cse0 36 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_624) .cse2 v_ArrVal_627) .cse3 v_ArrVal_628) .cse4 v_ArrVal_631) .cse5 v_ArrVal_632) .cse6 v_ArrVal_635) .cse7 v_ArrVal_637) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_636) c_create_data_~data~0.base) .cse8)))))))))))))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= 0 (+ 32 .cse0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_625))) (let ((.cse15 (select (select .cse24 c_create_data_~data~0.base) .cse8))) (let ((.cse23 (store .cse24 .cse15 v_ArrVal_626))) (let ((.cse16 (select (select .cse23 c_create_data_~data~0.base) .cse8))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_629))) (let ((.cse17 (select (select .cse22 c_create_data_~data~0.base) .cse8))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_630))) (let ((.cse18 (select (select .cse21 c_create_data_~data~0.base) .cse8))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_633))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_624) .cse15 v_ArrVal_627) .cse16 v_ArrVal_628) .cse17 v_ArrVal_631) .cse18 v_ArrVal_632) .cse19 v_ArrVal_635) (select (select (store .cse20 .cse19 v_ArrVal_634) c_create_data_~data~0.base) .cse8) v_ArrVal_637))))))))))) c_create_data_~data~0.base) .cse8))))))) is different from false [2024-11-10 15:13:43,798 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-10 15:13:43,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-10 15:13:43,799 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-10 15:13:43,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:13:44,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 15:13:44,001 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-10 15:13:44,005 INFO L158 Benchmark]: Toolchain (without parser) took 45954.81ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 114.7MB in the beginning and 133.2MB in the end (delta: -18.5MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-11-10 15:13:44,005 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:13:44,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.18ms. Allocated memory is still 163.6MB. Free memory was 113.8MB in the beginning and 93.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 15:13:44,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.06ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:13:44,006 INFO L158 Benchmark]: Boogie Preprocessor took 100.01ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:13:44,006 INFO L158 Benchmark]: IcfgBuilder took 877.12ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 97.1MB in the end (delta: -8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 15:13:44,006 INFO L158 Benchmark]: TraceAbstraction took 44396.26ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 97.1MB in the beginning and 133.2MB in the end (delta: -36.0MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2024-11-10 15:13:44,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.18ms. Allocated memory is still 163.6MB. Free memory was 113.8MB in the beginning and 93.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.06ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.01ms. Allocated memory is still 163.6MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 877.12ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 97.1MB in the end (delta: -8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44396.26ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 97.1MB in the beginning and 133.2MB in the end (delta: -36.0MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:13:45,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:13:46,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:13:46,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:13:46,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:13:46,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:13:46,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:13:46,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:13:46,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:13:46,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:13:46,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:13:46,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:13:46,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:13:46,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:13:46,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:13:46,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:13:46,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:13:46,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:13:46,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:13:46,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:13:46,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:13:46,105 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:13:46,105 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:13:46,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:13:46,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:13:46,106 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:13:46,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:13:46,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:13:46,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:13:46,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:13:46,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:13:46,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:13:46,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:13:46,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:13:46,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:13:46,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:13:46,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:13:46,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:13:46,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:13:46,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:13:46,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:13:46,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:13:46,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:13:46,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:13:46,123 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2024-11-10 15:13:46,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:13:46,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:13:46,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:13:46,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:13:46,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:13:46,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-10 15:13:48,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:13:48,310 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:13:48,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-10 15:13:48,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbc6e970/e6c63fe4121c49448460b0eb956daaff/FLAGf1030ca11 [2024-11-10 15:13:48,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbc6e970/e6c63fe4121c49448460b0eb956daaff [2024-11-10 15:13:48,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:13:48,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:13:48,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:13:48,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:13:48,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:13:48,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdf20d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48, skipping insertion in model container [2024-11-10 15:13:48,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:13:49,044 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:13:49,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:13:49,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:13:49,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:13:49,195 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:13:49,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49 WrapperNode [2024-11-10 15:13:49,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:13:49,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:13:49,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:13:49,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:13:49,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,258 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-10 15:13:49,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:13:49,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:13:49,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:13:49,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:13:49,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,313 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2024-11-10 15:13:49,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:13:49,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:13:49,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:13:49,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:13:49,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (1/1) ... [2024-11-10 15:13:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:13:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:49,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:13:49,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:13:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 15:13:49,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-10 15:13:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:13:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 15:13:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 15:13:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:13:49,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:13:49,555 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:13:49,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:13:49,986 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2024-11-10 15:13:50,335 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2024-11-10 15:13:50,381 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-10 15:13:50,381 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:13:50,401 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:13:50,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:13:50,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:50 BoogieIcfgContainer [2024-11-10 15:13:50,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:13:50,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:13:50,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:13:50,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:13:50,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:13:48" (1/3) ... [2024-11-10 15:13:50,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c4150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:50, skipping insertion in model container [2024-11-10 15:13:50,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:49" (2/3) ... [2024-11-10 15:13:50,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c4150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:50, skipping insertion in model container [2024-11-10 15:13:50,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:50" (3/3) ... [2024-11-10 15:13:50,411 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-10 15:13:50,430 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:13:50,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-10 15:13:50,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:13:50,474 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;@3d1d2dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:13:50,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-10 15:13:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 105 states have (on average 2.0285714285714285) internal successors, (213), 197 states have internal predecessors, (213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:13:50,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:50,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:13:50,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:50,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash 7571806, now seen corresponding path program 1 times [2024-11-10 15:13:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183768156] [2024-11-10 15:13:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:50,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:50,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 15:13:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:50,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:13:50,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:50,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 15:13:50,699 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:13:50,700 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 14 treesize of output 20 [2024-11-10 15:13:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:50,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:50,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:50,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183768156] [2024-11-10 15:13:50,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183768156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:50,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:13:50,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938663115] [2024-11-10 15:13:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:50,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:50,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:50,768 INFO L87 Difference]: Start difference. First operand has 201 states, 105 states have (on average 2.0285714285714285) internal successors, (213), 197 states have internal predecessors, (213), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:51,406 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-11-10 15:13:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:13:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:13:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:51,417 INFO L225 Difference]: With dead ends: 195 [2024-11-10 15:13:51,417 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 15:13:51,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:51,422 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 79 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:51,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 329 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:13:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 15:13:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-10 15:13:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.941747572815534) internal successors, (200), 188 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2024-11-10 15:13:51,525 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 4 [2024-11-10 15:13:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:51,526 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2024-11-10 15:13:51,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2024-11-10 15:13:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:13:51,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:51,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:13:51,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 15:13:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:51,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 7571807, now seen corresponding path program 1 times [2024-11-10 15:13:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:51,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225024717] [2024-11-10 15:13:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:51,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:51,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 15:13:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:13:51,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:51,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:13:51,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 15:13:51,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:13:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:13:51,909 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:13:51,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:13:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:51,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:51,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225024717] [2024-11-10 15:13:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225024717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:51,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:13:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058841627] [2024-11-10 15:13:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:51,932 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:52,627 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2024-11-10 15:13:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:13:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:13:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:52,631 INFO L225 Difference]: With dead ends: 208 [2024-11-10 15:13:52,631 INFO L226 Difference]: Without dead ends: 208 [2024-11-10 15:13:52,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:52,633 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 28 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:52,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 373 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:13:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-10 15:13:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2024-11-10 15:13:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 108 states have (on average 1.9166666666666667) internal successors, (207), 193 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-11-10 15:13:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2024-11-10 15:13:52,646 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 4 [2024-11-10 15:13:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:52,646 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2024-11-10 15:13:52,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2024-11-10 15:13:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:13:52,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:52,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:13:52,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 15:13:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:52,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 234726163, now seen corresponding path program 1 times [2024-11-10 15:13:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843218143] [2024-11-10 15:13:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:52,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:52,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:52,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:52,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 15:13:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:52,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 15:13:52,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:52,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 15:13:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:52,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:52,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843218143] [2024-11-10 15:13:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843218143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060066102] [2024-11-10 15:13:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:52,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:52,934 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:53,187 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-10 15:13:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:13:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:53,189 INFO L225 Difference]: With dead ends: 195 [2024-11-10 15:13:53,190 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 15:13:53,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:53,191 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:53,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:13:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 15:13:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-10 15:13:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 191 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2024-11-10 15:13:53,202 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 5 [2024-11-10 15:13:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:53,202 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2024-11-10 15:13:53,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2024-11-10 15:13:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:13:53,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:53,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:13:53,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 15:13:53,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:53,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 234726164, now seen corresponding path program 1 times [2024-11-10 15:13:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246388669] [2024-11-10 15:13:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:53,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:53,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:53,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:53,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 15:13:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:53,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:13:53,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:53,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:13:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:53,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:53,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246388669] [2024-11-10 15:13:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246388669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417148812] [2024-11-10 15:13:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:53,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:53,517 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:53,866 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-10 15:13:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:13:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:53,869 INFO L225 Difference]: With dead ends: 193 [2024-11-10 15:13:53,869 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 15:13:53,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:53,870 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:53,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:13:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 15:13:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-10 15:13:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 108 states have (on average 1.8611111111111112) 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-11-10 15:13:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2024-11-10 15:13:53,892 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 5 [2024-11-10 15:13:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:53,892 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2024-11-10 15:13:53,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2024-11-10 15:13:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:13:53,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:53,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:53,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 15:13:54,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:54,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2021505145, now seen corresponding path program 1 times [2024-11-10 15:13:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301340061] [2024-11-10 15:13:54,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:54,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:54,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 15:13:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:54,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:13:54,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:54,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:54,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301340061] [2024-11-10 15:13:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301340061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:54,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:13:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523099832] [2024-11-10 15:13:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:13:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:13:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:54,242 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:54,421 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2024-11-10 15:13:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:54,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:13:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:54,423 INFO L225 Difference]: With dead ends: 202 [2024-11-10 15:13:54,423 INFO L226 Difference]: Without dead ends: 202 [2024-11-10 15:13:54,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:13:54,433 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 18 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:54,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 742 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-10 15:13:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-10 15:13:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.853211009174312) internal successors, (202), 190 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-11-10 15:13:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2024-11-10 15:13:54,441 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 10 [2024-11-10 15:13:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:54,441 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2024-11-10 15:13:54,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2024-11-10 15:13:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:13:54,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:54,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:54,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 15:13:54,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:54,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:54,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1330615282, now seen corresponding path program 1 times [2024-11-10 15:13:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:54,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091374883] [2024-11-10 15:13:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:54,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:54,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:54,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:54,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 15:13:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:54,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:13:54,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:54,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:54,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091374883] [2024-11-10 15:13:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091374883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:13:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236085629] [2024-11-10 15:13:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:54,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:54,743 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:54,774 INFO L93 Difference]: Finished difference Result 275 states and 291 transitions. [2024-11-10 15:13:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 15:13:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:54,776 INFO L225 Difference]: With dead ends: 275 [2024-11-10 15:13:54,776 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 15:13:54,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:54,777 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 85 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:54,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 584 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:13:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 15:13:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 239. [2024-11-10 15:13:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.8758169934640523) internal successors, (287), 234 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 291 transitions. [2024-11-10 15:13:54,786 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 291 transitions. Word has length 12 [2024-11-10 15:13:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:54,786 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 291 transitions. [2024-11-10 15:13:54,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 291 transitions. [2024-11-10 15:13:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:13:54,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:54,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:54,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 15:13:54,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:54,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:54,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1178938707, now seen corresponding path program 1 times [2024-11-10 15:13:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:54,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829610361] [2024-11-10 15:13:54,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:54,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:54,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:54,990 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:54,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 15:13:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:55,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:13:55,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:55,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:13:55,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-10 15:13:55,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:13:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:55,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:55,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829610361] [2024-11-10 15:13:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829610361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:55,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:55,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453727561] [2024-11-10 15:13:55,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:55,117 INFO L87 Difference]: Start difference. First operand 239 states and 291 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:55,400 INFO L93 Difference]: Finished difference Result 224 states and 261 transitions. [2024-11-10 15:13:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-10 15:13:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:55,402 INFO L225 Difference]: With dead ends: 224 [2024-11-10 15:13:55,403 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 15:13:55,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:55,403 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:55,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 220 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:13:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 15:13:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-10 15:13:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 153 states have (on average 1.6797385620915033) internal successors, (257), 219 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 261 transitions. [2024-11-10 15:13:55,413 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 261 transitions. Word has length 14 [2024-11-10 15:13:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:55,414 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 261 transitions. [2024-11-10 15:13:55,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 261 transitions. [2024-11-10 15:13:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:13:55,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:55,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:55,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:13:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:55,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1178938708, now seen corresponding path program 1 times [2024-11-10 15:13:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:55,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450887979] [2024-11-10 15:13:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:55,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:55,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:55,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:55,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 15:13:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:55,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:13:55,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:55,715 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:13:55,716 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 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-10 15:13:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:55,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:55,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450887979] [2024-11-10 15:13:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450887979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495082941] [2024-11-10 15:13:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:55,730 INFO L87 Difference]: Start difference. First operand 224 states and 261 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:55,992 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2024-11-10 15:13:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-10 15:13:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:55,994 INFO L225 Difference]: With dead ends: 209 [2024-11-10 15:13:55,994 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 15:13:55,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:55,995 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:55,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 215 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:13:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 15:13:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 15:13:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.4836601307189543) internal successors, (227), 204 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-11-10 15:13:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2024-11-10 15:13:56,001 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 14 [2024-11-10 15:13:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:56,002 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2024-11-10 15:13:56,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2024-11-10 15:13:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:13:56,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:56,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:56,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 15:13:56,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:56,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:56,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1069046813, now seen corresponding path program 1 times [2024-11-10 15:13:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882269170] [2024-11-10 15:13:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:56,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:56,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:56,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 15:13:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:56,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:13:56,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:56,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 15:13:56,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:13:56,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:56,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:13:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:56,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:56,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:56,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882269170] [2024-11-10 15:13:56,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882269170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:13:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887079839] [2024-11-10 15:13:56,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:56,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:13:56,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:56,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:13:56,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:13:56,380 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:56,872 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2024-11-10 15:13:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:56,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 20 [2024-11-10 15:13:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:56,874 INFO L225 Difference]: With dead ends: 264 [2024-11-10 15:13:56,875 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 15:13:56,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:13:56,876 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:56,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 432 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:13:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 15:13:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 219. [2024-11-10 15:13:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 163 states have (on average 1.478527607361963) internal successors, (241), 214 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2024-11-10 15:13:56,884 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 20 [2024-11-10 15:13:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:56,884 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2024-11-10 15:13:56,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2024-11-10 15:13:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:13:56,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:56,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:56,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 15:13:57,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:57,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:57,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1069046812, now seen corresponding path program 1 times [2024-11-10 15:13:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:57,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493871168] [2024-11-10 15:13:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:57,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:57,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:57,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:57,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 15:13:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:57,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:13:57,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:57,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:13:57,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-10 15:13:57,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:13:57,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:57,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 15:13:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:57,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:13:57,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493871168] [2024-11-10 15:13:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493871168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:57,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:13:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882584765] [2024-11-10 15:13:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:57,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:13:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:13:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:13:57,351 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:57,849 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2024-11-10 15:13:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:13:57,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 20 [2024-11-10 15:13:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:57,851 INFO L225 Difference]: With dead ends: 219 [2024-11-10 15:13:57,851 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 15:13:57,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:13:57,852 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 4 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:57,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 457 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:13:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 15:13:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-10 15:13:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 214 states have internal predecessors, (237), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2024-11-10 15:13:57,857 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 20 [2024-11-10 15:13:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:57,857 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2024-11-10 15:13:57,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2024-11-10 15:13:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:13:57,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:57,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:57,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 15:13:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:58,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash -315602842, now seen corresponding path program 1 times [2024-11-10 15:13:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732684036] [2024-11-10 15:13:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:58,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:58,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:58,064 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:58,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 15:13:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:58,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 15:13:58,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:58,193 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:13:58,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-10 15:13:58,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:58,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:58,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-10 15:13:58,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-10 15:13:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:13:58,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:58,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_154) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))))) is different from false [2024-11-10 15:13:58,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse0) v_ArrVal_154) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2024-11-10 15:13:58,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:58,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-10 15:13:58,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-11-10 15:13:58,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:13:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:13:58,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:13:58,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732684036] [2024-11-10 15:13:58,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732684036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:58,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:13:58,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-10 15:13:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043763100] [2024-11-10 15:13:58,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:58,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:13:58,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:13:58,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:13:58,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2024-11-10 15:13:58,534 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:59,301 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2024-11-10 15:13:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:13:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 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 26 [2024-11-10 15:13:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:59,303 INFO L225 Difference]: With dead ends: 220 [2024-11-10 15:13:59,303 INFO L226 Difference]: Without dead ends: 220 [2024-11-10 15:13:59,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2024-11-10 15:13:59,303 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 44 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:59,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 732 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 0 Unknown, 192 Unchecked, 0.7s Time] [2024-11-10 15:13:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-10 15:13:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2024-11-10 15:13:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.4417177914110428) internal successors, (235), 213 states have internal predecessors, (235), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2024-11-10 15:13:59,308 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 26 [2024-11-10 15:13:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:59,309 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2024-11-10 15:13:59,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2024-11-10 15:13:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:13:59,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:59,310 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:59,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 15:13:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:59,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:13:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash -315602841, now seen corresponding path program 1 times [2024-11-10 15:13:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:13:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53099587] [2024-11-10 15:13:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:59,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:13:59,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:13:59,517 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:13:59,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 15:13:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:59,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:13:59,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:59,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:13:59,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-10 15:13:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:13:59,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:13:59,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:13:59,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:13:59,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:13:59,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:13:59,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:13:59,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:14:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:14:00,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:14:00,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_188) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_188) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_187) c_create_data_~data~0.base) .cse2)))))) is different from false [2024-11-10 15:14:00,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_188) c_create_data_~data~0.base) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_187) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_188) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse3 (_ bv4 32) .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2024-11-10 15:14:00,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_188) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_188) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_187) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-10 15:14:00,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-10 15:14:00,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:00,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-10 15:14:00,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-10 15:14:00,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-10 15:14:00,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 15:14:00,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:14:00,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:00,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-10 15:14:00,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2024-11-10 15:14:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:14:00,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:14:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53099587] [2024-11-10 15:14:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53099587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:14:00,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:14:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-10 15:14:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930001682] [2024-11-10 15:14:00,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:14:00,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:14:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:14:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:14:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2024-11-10 15:14:00,465 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:14:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:14:01,720 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2024-11-10 15:14:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:14:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 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 26 [2024-11-10 15:14:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:14:01,722 INFO L225 Difference]: With dead ends: 230 [2024-11-10 15:14:01,722 INFO L226 Difference]: Without dead ends: 230 [2024-11-10 15:14:01,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=136, Unknown=3, NotChecked=78, Total=272 [2024-11-10 15:14:01,723 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 4 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:14:01,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 937 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 249 Unchecked, 1.1s Time] [2024-11-10 15:14:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-10 15:14:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-11-10 15:14:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 225 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:14:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2024-11-10 15:14:01,730 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 26 [2024-11-10 15:14:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:14:01,731 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2024-11-10 15:14:01,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:14:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2024-11-10 15:14:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:14:01,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:14:01,732 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:14:01,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 15:14:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:14:01,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:14:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:14:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1541291690, now seen corresponding path program 2 times [2024-11-10 15:14:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:14:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305788646] [2024-11-10 15:14:01,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:14:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:14:01,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:14:01,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:14:01,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 15:14:02,071 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:14:02,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:14:02,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:14:02,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:14:02,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:14:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-10 15:14:02,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:14:02,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:14:02,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:14:02,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:02,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:02,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:02,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:02,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:02,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:02,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:14:02,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:14:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:14:02,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:14:02,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_230) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_229) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_230) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-11-10 15:14:02,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_230) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_229) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_230) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2024-11-10 15:14:02,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_230) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_229) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_230) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd (_ bv12 32) .cse3 .cse2))))))) is different from false [2024-11-10 15:14:03,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_228) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_227) c_create_data_~data~0.base) .cse3) v_ArrVal_230) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_227))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_228) .cse4 v_ArrVal_230) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_229) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-11-10 15:14:03,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_227))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_228) .cse1 v_ArrVal_230) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_229) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_228) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_227) c_create_data_~data~0.base) .cse2) v_ArrVal_230) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-10 15:14:03,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:03,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-10 15:14:03,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:03,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-10 15:14:03,729 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 400 treesize of output 334 [2024-11-10 15:14:03,740 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 288 treesize of output 264 [2024-11-10 15:14:03,764 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 23 treesize of output 19 [2024-11-10 15:14:03,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-10 15:14:03,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-10 15:14:03,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-10 15:14:03,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:03,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2024-11-10 15:14:03,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:03,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2024-11-10 15:14:03,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2024-11-10 15:14:03,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2024-11-10 15:14:03,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2024-11-10 15:14:03,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-10 15:14:03,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 15:14:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-10 15:14:03,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:14:03,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305788646] [2024-11-10 15:14:03,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305788646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:14:03,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:14:03,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-10 15:14:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312281502] [2024-11-10 15:14:03,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:14:03,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 15:14:03,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:14:03,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 15:14:03,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=158, Unknown=14, NotChecked=150, Total=380 [2024-11-10 15:14:03,983 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:14:06,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse4)) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (let ((.cse1 (select |c_#length| .cse3)) (.cse2 (bvadd (_ bv8 32) .cse7 .cse5)) (.cse0 (bvadd (_ bv4 32) .cse7 .cse5))) (and (bvule .cse0 .cse1) (bvule .cse2 .cse1) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_230) c_create_data_~data~0.base) .cse4) .cse5) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_229) c_create_data_~data~0.base) .cse4)))) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_230) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) .cse6 .cse5) (bvadd (_ bv12 32) .cse6 .cse5)))) (bvule .cse0 .cse2) (bvule (bvadd .cse7 .cse5) .cse0))))) is different from false [2024-11-10 15:14:06,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1)) (.cse3 (bvadd (_ bv4 32) .cse5 .cse2))) (and (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_230) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_229) c_create_data_~data~0.base) .cse1)))) (bvule .cse3 (select |c_#length| .cse0)) (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_230) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse4 .cse2) (bvadd (_ bv8 32) .cse4 .cse2)))) (bvule (bvadd .cse5 .cse2) .cse3))))) is different from false [2024-11-10 15:14:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:14:08,789 INFO L93 Difference]: Finished difference Result 266 states and 291 transitions. [2024-11-10 15:14:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:14:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 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 32 [2024-11-10 15:14:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:14:08,791 INFO L225 Difference]: With dead ends: 266 [2024-11-10 15:14:08,792 INFO L226 Difference]: Without dead ends: 266 [2024-11-10 15:14:08,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=283, Unknown=23, NotChecked=294, Total=702 [2024-11-10 15:14:08,793 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 4 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:14:08,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1510 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 719 Invalid, 15 Unknown, 571 Unchecked, 4.2s Time] [2024-11-10 15:14:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-10 15:14:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-10 15:14:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 211 states have (on average 1.3601895734597156) internal successors, (287), 261 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:14:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 291 transitions. [2024-11-10 15:14:08,805 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 291 transitions. Word has length 32 [2024-11-10 15:14:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:14:08,805 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 291 transitions. [2024-11-10 15:14:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:14:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 291 transitions. [2024-11-10 15:14:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:14:08,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:14:08,806 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-10 15:14:08,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 15:14:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:14:09,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:14:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:14:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1502590953, now seen corresponding path program 1 times [2024-11-10 15:14:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:14:09,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162124793] [2024-11-10 15:14:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:14:09,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:14:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:14:09,011 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:14:09,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 15:14:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:09,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:14:09,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:14:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:14:09,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:14:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:14:09,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:14:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162124793] [2024-11-10 15:14:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162124793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:14:09,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:14:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 15:14:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887140801] [2024-11-10 15:14:09,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:14:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:14:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:14:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:14:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:14:09,276 INFO L87 Difference]: Start difference. First operand 266 states and 291 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:14:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:14:09,470 INFO L93 Difference]: Finished difference Result 296 states and 321 transitions. [2024-11-10 15:14:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:14:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-10 15:14:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:14:09,475 INFO L225 Difference]: With dead ends: 296 [2024-11-10 15:14:09,475 INFO L226 Difference]: Without dead ends: 296 [2024-11-10 15:14:09,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:14:09,476 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 20 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:14:09,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1180 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:14:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-10 15:14:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-11-10 15:14:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 241 states have (on average 1.3153526970954357) internal successors, (317), 291 states have internal predecessors, (317), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:14:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2024-11-10 15:14:09,483 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 45 [2024-11-10 15:14:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:14:09,483 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2024-11-10 15:14:09,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:14:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2024-11-10 15:14:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:14:09,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:14:09,487 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:14:09,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-10 15:14:09,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:14:09,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-10 15:14:09,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:14:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 480832499, now seen corresponding path program 3 times [2024-11-10 15:14:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:14:09,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48365865] [2024-11-10 15:14:09,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:14:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:14:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:14:09,692 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:14:09,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 15:14:10,044 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 15:14:10,044 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:14:10,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 15:14:10,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:14:10,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:14:10,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-10 15:14:10,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:14:10,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:14:10,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:14:10,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:10,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:10,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:10,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:10,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:10,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:10,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:10,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:10,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:10,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:10,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:11,007 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:14:11,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:14:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:14:11,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:14:11,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:14:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:14:11,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:14:11,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_341) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_342) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_341) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2024-11-10 15:14:11,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-10 15:14:11,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))) is different from false [2024-11-10 15:14:11,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_339))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_340) .cse0 v_ArrVal_341) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_342) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_339) c_create_data_~data~0.base) .cse1) v_ArrVal_341) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd (_ bv12 32) .cse4 .cse2)))))) is different from false [2024-11-10 15:14:11,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_340) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd (_ bv12 32) .cse0 .cse1)))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_339))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_340) .cse4 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_342) c_create_data_~data~0.base) .cse3))))))))) is different from false [2024-11-10 15:14:12,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_337))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_338) .cse2 v_ArrVal_340) (select (select (store .cse3 .cse2 v_ArrVal_339) c_create_data_~data~0.base) .cse4) v_ArrVal_341))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv12 32) .cse0 .cse1) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_337))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_339))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_338) .cse5 v_ArrVal_340) .cse6 v_ArrVal_341) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_342) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2024-11-10 15:14:12,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_337))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_338) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) (_ bv16 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_337))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_338) .cse8 v_ArrVal_340) (select (select (store .cse9 .cse8 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse7 (_ bv12 32) .cse4) (bvadd .cse7 (_ bv16 32) .cse4))))))) is different from false [2024-11-10 15:14:12,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_337))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_338) .cse3 v_ArrVal_340) (select (select (store .cse4 .cse3 v_ArrVal_339) c_create_data_~data~0.base) .cse5) v_ArrVal_341))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 (_ bv16 32) .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_337))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_339))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_338) .cse6 v_ArrVal_340) .cse7 v_ArrVal_341) c_create_data_~data~0.base) .cse5) (_ bv20 32) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_342) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2024-11-10 15:14:13,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_335))) (let ((.cse0 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_337))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_339))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_336) .cse0 v_ArrVal_338) .cse1 v_ArrVal_340) .cse2 v_ArrVal_341) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_342) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_335))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_337))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_336) .cse9 v_ArrVal_338) .cse10 v_ArrVal_340) (select (select (store .cse11 .cse10 v_ArrVal_339) c_create_data_~data~0.base) .cse3) v_ArrVal_341))))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse8 .cse4) (bvadd (_ bv20 32) .cse8 .cse4)))))) is different from false